Marina Lenisa

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 13

Top Topics

Possibilistic Logic

Higher Order Logic

Logical Framework

Resource Bounded

Top Venues

Fundam. Informaticae

Publications

Furio Honsell, Marina Lenisa, Ivan Scagnetto
Principal Types as Partial Involutions. CoRR (2024)
Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone
On Quantitative Algebraic Higher-Order Theories. FSCD (2022)
Ugo Dal Lago, Furio Honsell, Marina Lenisa, Paolo Pistone
On Quantitative Algebraic Higher-Order Theories. CoRR (2022)
Pietro Di Gianantonio, Marina Lenisa
Principal Types as Lambda Nets. TYPES (2021)
Furio Honsell, Marina Lenisa, Ivan Scagnetto
Λ-Symsym: An Interactive Tool for Playing with Involutions and Types. TYPES (2020)
Fabio Alessi, Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa
A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning. LFMTP@LICS (2019)
Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto
lambda!-calculus, Intersection Types, and Involutions. FSCD (2019)
Fabio Alessi, Alberto Ciaffaglione, Pietro Di Gianantonio, Furio Honsell, Marina Lenisa, Ivan Scagnetto
LF+ in Coq for "fast and loose" reasoning. J. Formaliz. Reason. 12 (1) (2019)
Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto
The involutions-as-principal types/application-as-unification Analogy. LPAR (2018)
Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto
Linear lambda-calculus and Reversible Automatic Combinators. CoRR (2018)
Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto
Implementing Cantor's Paradise. APLAS (2016)
Furio Honsell, Marina Lenisa, Ivan Scagnetto, Luigi Liquori, Petar Maksimovic
An open logical framework. J. Log. Comput. 26 (1) (2016)
Marina Lenisa
Multigames and strategies, coalgebraically. Theor. Comput. Sci. 604 (2015)
Marina Lenisa
Coalgebraic Multigames. CMCS (2014)
Furio Honsell, Marina Lenisa, Daniel Pellarini
Categories of Coalgebraic Games with Selective Sum. Fundam. Informaticae 134 (3-4) (2014)
Furio Honsell, Marina Lenisa
Unfixing the Fixpoint: The Theories of the λY-Calculus. Computation, Logic, Games, and Quantum Foundations (2013)
Pietro Di Gianantonio, Marina Lenisa
Innocent Game Semantics via Intersection Type Assignment Systems. CSL (2013)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Equivalences and Congruences on Infinite Conway Games. RAIRO Theor. Informatics Appl. 46 (2) (2012)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Categories of Coalgebraic Games. MFCS (2012)
Furio Honsell, Marina Lenisa
Conway games, algebraically and coalgebraically Log. Methods Comput. Sci. 7 (3) (2011)
Pietro Di Gianantonio, Svetlana Jaksic, Marina Lenisa
-Calculus. CONCUR (2010)
Furio Honsell, Marina Lenisa
Conway Games, Coalgebraically. CALCO (2009)
Pietro Di Gianantonio, Furio Honsell, Marina Lenisa
RPO, Second-order Contexts, and Lambda-calculus Log. Methods Comput. Sci. 5 (3) (2009)
Furio Honsell, Marina Lenisa, Luigi Liquori, Ivan Scagnetto
A Conditional Logical Framework. LPAR (2008)
Pietro Di Gianantonio, Furio Honsell, Marina Lenisa
RPO, Second-Order Contexts, and lambda-Calculus. FoSSaCS (2008)
Pietro Di Gianantonio, Furio Honsell, Marina Lenisa
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi. WADT (2008)
Pietro Di Gianantonio, Furio Honsell, Marina Lenisa
A type assignment system for game semantics. Theor. Comput. Sci. 398 (1-3) (2008)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Coalgebraic description of generalised binary methods. Math. Struct. Comput. Sci. 17 (4) (2007)
Furio Honsell, Marina Lenisa, Luigi Liquori
A Framework for Defining Logical Frameworks. Electron. Notes Theor. Comput. Sci. 172 (2007)
Daniela Cancila, Furio Honsell, Marina Lenisa
Functors Determined by Values on Objects. MFPS (2006)
Daniela Cancila, Furio Honsell, Marina Lenisa
Some Properties and Some Problems on Set Functors. CMCS (2006)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Coalgebraic Description of Generalized Binary Methods. Electron. Notes Theor. Comput. Sci. 135 (3) (2006)
Samson Abramsky, Marina Lenisa
Linear realizability and full completeness for typed lambda-calculi. Ann. Pure Appl. Log. 134 (2-3) (2005)
Furio Honsell, Marina Lenisa, Marino Miculan
Preface. Electron. Notes Theor. Comput. Sci. 104 (2004)
Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan
Modeling Fresh Names in the ?-calculus Using Abstractions. CMCS (2004)
Daniela Cancila, Furio Honsell, Marina Lenisa
Properties of Set Functors. Electron. Notes Theor. Comput. Sci. 104 (2004)
Marina Lenisa, John Power, Hiroshi Watanabe
Category theory for operational semantics. Theor. Comput. Sci. 327 (1-2) (2004)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Coalgebraic Semantics and Observational Equivalences of an Imperative Class-based OO-Language. Electron. Notes Theor. Comput. Sci. 104 (2004)
Furio Honsell, Marina Lenisa
"Wave-Style" Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models. TYPES (2003)
Furio Honsell, Marina Lenisa, Rekha Redamalla
Strict Geometry of Interaction Graph Models. LPAR (2003)
Daniela Cancila, Furio Honsell, Marina Lenisa
Generalized Coiteration Schemata. CMCS (2003)
Samson Abramsky, Marina Lenisa
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus. CSL (2001)
Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan
Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic. Electron. Notes Theor. Comput. Sci. 62 (2001)
Marina Lenisa, Marino Miculan
Preface. Electron. Notes Theor. Comput. Sci. 62 (2001)
Andrea Corradini, Marina Lenisa, Ugo Montanari
Preface. CMCS (2001)
Samson Abramsky, Marina Lenisa
Axiomatizing Fully Complete Models for ML Polymorphic Types. MFCS (2000)
Marina Lenisa, John Power, Hiroshi Watanabe
Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. CMCS (2000)
Furio Honsell, Marina Lenisa
Coalgebraic Coinduction in (Hyper)set-theoretic Categories. CMCS (2000)
Samson Abramsky, Marina Lenisa
A Fully Complete PER Model for ML Polymorphic Types. CSL (2000)
Marina Lenisa
A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects. FoSSaCS (1999)
Furio Honsell, Marina Lenisa
Coinductive characterizations of applicative structures. Math. Struct. Comput. Sci. 9 (4) (1999)
Marina Lenisa
From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems. CMCS (1999)
Furio Honsell, Marina Lenisa
Semantical Analysis of Perpetual Strategies in lambda-Calculus. Theor. Comput. Sci. 212 (1-2) (1999)
Furio Honsell, Marina Lenisa, Ugo Montanari, Marco Pistore
Final semantics for the pi-calculus. PROCOMET (1998)
Marina Lenisa
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi. TAPSOFT (1997)
Marina Lenisa
Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi. TLCA (1997)
Marco Forti, Furio Honsell, Marina Lenisa
An Axiomatization of Partial n-Place Operations. Math. Struct. Comput. Sci. 7 (3) (1997)
Marina Lenisa
Final Semantics for a Higher Order Concurrent Language. CAAP (1996)
Furio Honsell, Marina Lenisa
Final Semantics for untyped lambda-calculus. TLCA (1995)
Michael Forti, Furio Honsell, Marina Lenisa
Processes and Hyperuniverses. MFCS (1994)
Furio Honsell, Marina Lenisa
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi. MFCS (1993)