Marina Lenisa - RankMe

67 papers B 19Journal 18Unranked 27

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