The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Marina Lenisa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marina Lenisa
    Final Semantics for a Higher Order Concurrent Language. [Citation Graph (0, 0)][DBLP]
    CAAP, 1996, pp:102-118 [Conf]
  2. Samson Abramsky, Marina Lenisa
    A Fully Complete PER Model for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2000, pp:140-155 [Conf]
  3. Samson Abramsky, Marina Lenisa
    Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:443-457 [Conf]
  4. Marina Lenisa
    A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:243-257 [Conf]
  5. Furio Honsell, Marina Lenisa, Rekha Redamalla
    Strict Geometry of Interaction Graph Models. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:407-421 [Conf]
  6. Samson Abramsky, Marina Lenisa
    Axiomatizing Fully Complete Models for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:141-151 [Conf]
  7. Michael Forti, Furio Honsell, Marina Lenisa
    Processes and Hyperuniverses. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:352-363 [Conf]
  8. Furio Honsell, Marina Lenisa
    Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:84-104 [Conf]
  9. Furio Honsell, Marina Lenisa, Ugo Montanari, Marco Pistore
    Final semantics for the pi-calculus. [Citation Graph (0, 0)][DBLP]
    PROCOMET, 1998, pp:225-243 [Conf]
  10. Marina Lenisa
    A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:309-320 [Conf]
  11. Furio Honsell, Marina Lenisa
    Final Semantics for untyped lambda-calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:249-265 [Conf]
  12. Marina Lenisa
    Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi. [Citation Graph (0, 0)][DBLP]
    TLCA, 1997, pp:248-266 [Conf]
  13. Furio Honsell, Marina Lenisa
    "Wave-Style" Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models. [Citation Graph (0, 0)][DBLP]
    TYPES, 2003, pp:242-258 [Conf]
  14. Samson Abramsky, Marina Lenisa
    Linear realizability and full completeness for typed lambda-calculi. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:122-168 [Journal]
  15. Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan
    Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
  16. Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan
    Modeling Fresh Names in the ?-calculus Using Abstractions. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:106, n:, pp:25-41 [Journal]
  17. Daniela Cancila, Furio Honsell, Marina Lenisa
    Generalized Coiteration Schemata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:82, n:1, pp:- [Journal]
  18. Daniela Cancila, Furio Honsell, Marina Lenisa
    Properties of Set Functors. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:104, n:, pp:61-80 [Journal]
  19. Daniela Cancila, Furio Honsell, Marina Lenisa
    Functors Determined by Values on Objects. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:151-169 [Journal]
  20. Andrea Corradini, Marina Lenisa, Ugo Montanari
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
  21. Furio Honsell, Marina Lenisa
    Coalgebraic Coinduction in (Hyper)set-theoretic Categories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:33, n:, pp:- [Journal]
  22. Furio Honsell, Marina Lenisa, Marino Miculan
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:104, n:, pp:1-3 [Journal]
  23. Furio Honsell, Marina Lenisa, Rekha Redamalla
    Coalgebraic Semantics and Observational Equivalences of an Imperative Class-based OO-Language. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:104, n:, pp:163-180 [Journal]
  24. Furio Honsell, Marina Lenisa, Rekha Redamalla
    Coalgebraic Description of Generalized Binary Methods. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:135, n:3, pp:73-84 [Journal]
  25. Marina Lenisa
    From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:19, n:, pp:- [Journal]
  26. Marina Lenisa, Marino Miculan
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
  27. Marina Lenisa, John Power, Hiroshi Watanabe
    Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:33, n:, pp:- [Journal]
  28. Daniela Cancila, Furio Honsell, Marina Lenisa
    Some Properties and Some Problems on Set Functors. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:164, n:1, pp:67-84 [Journal]
  29. Furio Honsell, Marina Lenisa, Luigi Liquori
    A Framework for Defining Logical Frameworks. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:399-436 [Journal]
  30. Marco Forti, Furio Honsell, Marina Lenisa
    An Axiomatization of Partial n-Place Operations. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:3, pp:283-302 [Journal]
  31. Furio Honsell, Marina Lenisa
    Coinductive characterizations of applicative structures. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:403-435 [Journal]
  32. Furio Honsell, Marina Lenisa
    Semantical Analysis of Perpetual Strategies in lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:212, n:1-2, pp:183-209 [Journal]
  33. Marina Lenisa, John Power, Hiroshi Watanabe
    Category theory for operational semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:1-2, pp:135-154 [Journal]

  34. Conway Games, Coalgebraically. [Citation Graph (, )][DBLP]


  35. Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. [Citation Graph (, )][DBLP]


  36. RPO, Second-Order Contexts, and lambda-Calculus. [Citation Graph (, )][DBLP]


  37. A Conditional Logical Framework. [Citation Graph (, )][DBLP]


  38. Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi. [Citation Graph (, )][DBLP]


  39. RPO, Second-order Contexts, and Lambda-calculus [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002