|
Search the dblp DataBase
Marina Lenisa:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Marina Lenisa
Final Semantics for a Higher Order Concurrent Language. [Citation Graph (0, 0)][DBLP] CAAP, 1996, pp:102-118 [Conf]
- Samson Abramsky, Marina Lenisa
A Fully Complete PER Model for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP] CSL, 2000, pp:140-155 [Conf]
- 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]
- Marina Lenisa
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. [Citation Graph (0, 0)][DBLP] FoSSaCS, 1999, pp:243-257 [Conf]
- Furio Honsell, Marina Lenisa, Rekha Redamalla
Strict Geometry of Interaction Graph Models. [Citation Graph (0, 0)][DBLP] LPAR, 2003, pp:407-421 [Conf]
- Samson Abramsky, Marina Lenisa
Axiomatizing Fully Complete Models for ML Polymorphic Types. [Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:141-151 [Conf]
- Michael Forti, Furio Honsell, Marina Lenisa
Processes and Hyperuniverses. [Citation Graph (0, 0)][DBLP] MFCS, 1994, pp:352-363 [Conf]
- 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]
- 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]
- Marina Lenisa
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. [Citation Graph (0, 0)][DBLP] TAPSOFT, 1997, pp:309-320 [Conf]
- Furio Honsell, Marina Lenisa
Final Semantics for untyped lambda-calculus. [Citation Graph (0, 0)][DBLP] TLCA, 1995, pp:249-265 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Andrea Corradini, Marina Lenisa, Ugo Montanari
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- Marina Lenisa, Marino Miculan
Preface. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:62, n:, pp:- [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Conway Games, Coalgebraically. [Citation Graph (, )][DBLP]
Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. [Citation Graph (, )][DBLP]
RPO, Second-Order Contexts, and lambda-Calculus. [Citation Graph (, )][DBLP]
A Conditional Logical Framework. [Citation Graph (, )][DBLP]
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi. [Citation Graph (, )][DBLP]
RPO, Second-order Contexts, and Lambda-calculus [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.304secs
|