Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. - Furio Honsell; Marina Lenisa (MFCS, 1993)

Processes and Hyperuniverses. - Michael Forti; Furio Honsell; Marina Lenisa (MFCS, 1994)

Final Semantics for untyped lambda-calculus. - Furio Honsell; Marina Lenisa (TLCA, 1995)

Final Semantics for a Higher Order Concurrent Language. - Marina Lenisa (CAAP, 1996)

A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. - Marina Lenisa (TAPSOFT, 1997)

Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi. - Marina Lenisa (TLCA, 1997)

An Axiomatization of Partial n-Place Operations. - Marco Forti; Furio Honsell; Marina Lenisa (Math. Struct. Comput. Sci., 1997)

Final semantics for the pi-calculus. - Furio Honsell; Marina Lenisa; Ugo Montanari; Marco Pistore (PROCOMET, 1998)

A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. - Marina Lenisa (FoSSaCS, 1999)

From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. - Marina Lenisa (CMCS, 1999)

Coinductive characterizations of applicative structures. - Furio Honsell; Marina Lenisa (Math. Struct. Comput. Sci., 1999)

Semantical Analysis of Perpetual Strategies in lambda-Calculus. - Furio Honsell; Marina Lenisa (Theor. Comput. Sci., 1999)

A Fully Complete PER Model for ML Polymorphic Types. - Samson Abramsky; Marina Lenisa (CSL, 2000)

Axiomatizing Fully Complete Models for ML Polymorphic Types. - Samson Abramsky; Marina Lenisa (MFCS, 2000)

Coalgebraic Coinduction in (Hyper)set-theoretic Categories. - Furio Honsell; Marina Lenisa (CMCS, 2000)

Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. - Marina Lenisa; John Power; Hiroshi Watanabe 002 (CMCS, 2000)

Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. - Samson Abramsky; Marina Lenisa (CSL, 2001)

Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic. - Roberto Bruni 001; Furio Honsell; Marina Lenisa; Marino Miculan (TOSCA, 2001)

Preface. - Andrea Corradini 001; Marina Lenisa; Ugo Montanari (CMCS, 2001)

Preface. - Marina Lenisa; Marino Miculan (TOSCA, 2001)

Strict Geometry of Interaction Graph Models. - Furio Honsell; Marina Lenisa; Rekha Redamalla (LPAR, 2003)

"Wave-Style" Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models. - Furio Honsell; Marina Lenisa (TYPES, 2003)

Generalized Coiteration Schemata. - Daniela Cancila; Furio Honsell; Marina Lenisa (CMCS, 2003)

Properties of Set Functors. - Daniela Cancila; Furio Honsell; Marina Lenisa (COMETA, 2003)

Preface. - Furio Honsell; Marina Lenisa; Marino Miculan (COMETA, 2003)

Coalgebraic Semantics and Observational Equivalences of an Imperative Class-based OO-Language. - Furio Honsell; Marina Lenisa; Rekha Redamalla (COMETA, 2003)

Modeling Fresh Names in the π-calculus Using Abstractions. - Roberto Bruni 001; Furio Honsell; Marina Lenisa; Marino Miculan (CMCS, 2004)

Category theory for operational semantics. - Marina Lenisa; John Power; Hiroshi Watanabe 002 (Theor. Comput. Sci., 2004)

Linear realizability and full completeness for typed lambda-calculi. - Samson Abramsky; Marina Lenisa (Ann. Pure Appl. Log., 2005)

Coalgebraic Description of Generalized Binary Methods. - Furio Honsell; Marina Lenisa; Rekha Redamalla (DCM@ICALP, 2005)

Functors Determined by Values on Objects. - Daniela Cancila; Furio Honsell; Marina Lenisa (MFPS, 2006)

Some Properties and Some Problems on Set Functors. - Daniela Cancila; Furio Honsell; Marina Lenisa (CMCS, 2006)

A Framework for Defining Logical Frameworks. - Furio Honsell; Marina Lenisa; Luigi Liquori (Computation, Meaning, and Logic, 2007)

Coalgebraic description of generalised binary methods. - Furio Honsell; Marina Lenisa; Rekha Redamalla (Math. Struct. Comput. Sci., 2007)

A Conditional Logical Framework. - Furio Honsell; Marina Lenisa; Luigi Liquori; Ivan Scagnetto (LPAR, 2008)

Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi. - Pietro Di Gianantonio; Furio Honsell; Marina Lenisa (WADT, 2008)

A type assignment system for game semantics. - Pietro Di Gianantonio; Furio Honsell; Marina Lenisa (Theor. Comput. Sci., 2008)

Conway Games, Coalgebraically. - Furio Honsell; Marina Lenisa (CALCO, 2009)

RPO, Second-order Contexts, and Lambda-calculus - Pietro Di Gianantonio; Furio Honsell; Marina Lenisa (Log. Methods Comput. Sci., 2009)

Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. - Pietro Di Gianantonio; Svetlana Jaksic; Marina Lenisa (CONCUR, 2010)

Conway games, algebraically and coalgebraically - Furio Honsell; Marina Lenisa (Log. Methods Comput. Sci., 2011)

Categories of Coalgebraic Games. - Furio Honsell; Marina Lenisa; Rekha Redamalla (MFCS, 2012)

Equivalences and Congruences on Infinite Conway Games. - Furio Honsell; Marina Lenisa; Rekha Redamalla (RAIRO Theor. Informatics Appl., 2012)

Unfixing the Fixpoint: The Theories of the λY-Calculus. - Furio Honsell; Marina Lenisa (Computation, Logic, Games, and Quantum Foundations, 2013)

Innocent Game Semantics via Intersection Type Assignment Systems. - Pietro Di Gianantonio; Marina Lenisa (CSL, 2013)

Coalgebraic Multigames. - Marina Lenisa (CMCS, 2014)

Categories of Coalgebraic Games with Selective Sum. - Furio Honsell; Marina Lenisa; Daniel Pellarini (Fundam. Informaticae, 2014)

Multigames and strategies, coalgebraically. - Marina Lenisa (Theor. Comput. Sci., 2015)

Implementing Cantor's Paradise. - Furio Honsell; Marina Lenisa; Luigi Liquori; Ivan Scagnetto (APLAS, 2016)

An open logical framework. - Furio Honsell; Marina Lenisa; Ivan Scagnetto; Luigi Liquori; Petar Maksimovic 001 (J. Log. Comput., 2016)

The involutions-as-principal types/application-as-unification Analogy. - Alberto Ciaffaglione; Furio Honsell; Marina Lenisa; Ivan Scagnetto (LPAR, 2018)

Linear lambda-calculus and Reversible Automatic Combinators. - Alberto Ciaffaglione; Furio Honsell; Marina Lenisa; Ivan Scagnetto (CoRR, 2018)

lambda!-calculus, Intersection Types, and Involutions. - Alberto Ciaffaglione; Pietro Di Gianantonio; Furio Honsell; Marina Lenisa; Ivan Scagnetto (FSCD, 2019)

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning. - Fabio Alessi; Alberto Ciaffaglione; Pietro Di Gianantonio; Furio Honsell; Marina Lenisa (LFMTP@LICS, 2019)

LF+ in Coq for "fast and loose" reasoning. - Fabio Alessi; Alberto Ciaffaglione; Pietro Di Gianantonio; Furio Honsell; Marina Lenisa; Ivan Scagnetto (J. Formaliz. Reason., 2019)

Λ-Symsym: An Interactive Tool for Playing with Involutions and Types. - Furio Honsell; Marina Lenisa; Ivan Scagnetto (TYPES, 2020)

Principal Types as Lambda Nets. - Pietro Di Gianantonio; Marina Lenisa (TYPES, 2021)

On Quantitative Algebraic Higher-Order Theories. - Ugo Dal Lago; Furio Honsell; Marina Lenisa; Paolo Pistone (FSCD, 2022)

Two Views on Unification: Terms as Strategies. - Furio Honsell; Marina Lenisa; Ivan Scagnetto (FSTTCS, 2024)

Principal types as partial involutions. - Furio Honsell; Marina Lenisa; Ivan Scagnetto (Math. Struct. Comput. Sci., 2025)