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