Marina Lenisa

CoRR, 2024

Two Views on Unification: Terms as Strategies.

[BibT_eX]

[DOI]

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2022

On Quantitative Algebraic Higher-Order Theories.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021

Principal Types as Lambda Nets.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Types for Proofs and Programs, 2021

2020

Λ-Symsym: An Interactive Tool for Playing with Involutions and Types.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Types for Proofs and Programs, 2020

2019

LF+ in Coq for "fast and loose" reasoning.

[BibT_eX]

[DOI]

Fabio Alessi

Alberto Ciaffaglione

J. Formaliz. Reason., 2019

A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning.

[BibT_eX]

[DOI]

Fabio Alessi

Alberto Ciaffaglione

Proceedings of the Fourteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2019

lambda!-calculus, Intersection Types, and Involutions.

[BibT_eX]

[DOI]

Alberto Ciaffaglione

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018

Linear lambda-calculus and Reversible Automatic Combinators.

[BibT_eX]

[DOI]

CoRR, 2018

The involutions-as-principal types/application-as-unification Analogy.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

2016

An open logical framework.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Implementing Cantor's Paradise.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 14th Asian Symposium, 2016

2015

Multigames and strategies, coalgebraically.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2014

Categories of Coalgebraic Games with Selective Sum.

[BibT_eX]

[DOI]

Daniel Pellarini

Fundam. Informaticae, 2014

Coalgebraic Multigames.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013

Innocent Game Semantics via Intersection Type Assignment Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Unfixing the Fixpoint: The Theories of the λY-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012

Equivalences and Congruences on Infinite Conway Games.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

Categories of Coalgebraic Games.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Conway games, algebraically and coalgebraically

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

2010

Efficient Bisimilarities from Second-Order Reaction Semantics for <i>pi</i>-Calculus.

[BibT_eX]

[DOI]

Svetlana Jaksic

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

RPO, Second-order Contexts, and Lambda-calculus

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

Conway Games, Coalgebraically.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008

A type assignment system for game semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Algebraic Development Techniques, 2008

A Conditional Logical Framework.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

2007

Coalgebraic description of generalised binary methods.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2007

A Framework for Defining Logical Frameworks.

[BibT_eX]

[DOI]

Luigi Liquori

Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

2006

Some Properties and Some Problems on Set Functors.

[BibT_eX]

[DOI]

Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

Functors Determined by Values on Objects.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

2005

Coalgebraic Description of Generalized Binary Methods.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Developments in Computational Models, 2005

Linear realizability and full completeness for typed lambda-calculi.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

2004

Category theory for operational semantics.

[BibT_eX]

[DOI]

John Power

Hiroshi Watanabe

Theor. Comput. Sci., 2004

Modeling Fresh Names in the ?-calculus Using Abstractions.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

2003

Coalgebraic Semantics and Observational Equivalences of an Imperative Class-based OO-Language.

[BibT_eX]

[DOI]

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Preface.

[BibT_eX]

[DOI]

Marino Miculan

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Properties of Set Functors.

[BibT_eX]

[DOI]

Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

Generalized Coiteration Schemata.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

"Wave-Style" Geometry of Interaction Models in Rel Are Graph-Like Lambda-Models.

[BibT_eX]

[DOI]

Proceedings of the Types for Proofs and Programs, International Workshop, 2003

Strict Geometry of Interaction Graph Models.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2003

2001

Preface.

[BibT_eX]

[DOI]

Marino Miculan

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Preface.

[BibT_eX]

[DOI]

Andrea Corradini

Ugo Montanari

Proceedings of the Coalgebraic Methods in Computer Science, 2001

Comparing Higher-Order Encodings in Logical Frameworks and Tile Logic.

[BibT_eX]

[DOI]

Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads.

[BibT_eX]

[DOI]

John Power

Hiroshi Watanabe

Proceedings of the Coalgebraic Methods in Computer Science, 2000

Coalgebraic Coinduction in (Hyper)set-theoretic Categories.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 2000

Axiomatizing Fully Complete Models for ML Polymorphic Types.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

A Fully Complete PER Model for ML Polymorphic Types.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2000

1999

Semantical Analysis of Perpetual Strategies in lambda-Calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Coinductive characterizations of applicative structures.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1999

From Set-theoretic Coinduction to Coalgebraic Coinduction: some results, some problems.

[BibT_eX]

[DOI]

Proceedings of the Coalgebraic Methods in Computer Science, 1999

A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998

Final semantics for the pi-calculus.

[BibT_eX]

Proceedings of the Programming Concepts and Methods, 1998

1997

An Axiomatization of Partial n-Place Operations.

[BibT_eX]

[DOI]

Marco Forti

Math. Struct. Comput. Sci., 1997

Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for Lambda-calculi.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1997

A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1996

Final Semantics for a Higher Order Concurrent Language.

[BibT_eX]

[DOI]

Proceedings of the Trees in Algebra and Programming, 1996

1995

Final Semantics for untyped lambda-calculus.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 1995

1994

Processes and Hyperuniverses.

[BibT_eX]

[DOI]

Michael Forti

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

Some Results on the Full Abstraction Problem for Restricted Lambda Calculi.

[BibT_eX]

[DOI]