Antonino Salibra

RAIRO Theor. Informatics Appl., 2012

The stack calculus

[BibT_eX]

[DOI]

Thomas Ehrhard

Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Minimal lambda-theories by ultraproducts

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

Scott Is Always Simple.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

On the equational consistency of order-theoretic models of the lambda-calculus.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic (CSL'12), 2012

2010

Applying Universal Algebra to Lambda Calculus.

[BibT_eX]

[DOI]

J. Log. Comput., 2010

Resource Combinatory Algebras.

[BibT_eX]

[DOI]

Thomas Ehrhard

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Exponentials with Infinite Multiplicities.

[BibT_eX]

[DOI]

Thomas Ehrhard

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Effective lambda-models versus recursively enumerable lambda-theories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

On Linear Information Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Linearity, 2009

Reflexive Scott Domains are Not Complete for the Extensional Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

Graph lambda theories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

Effective lambda-models vs recursively enumerable lambda-theories

[BibT_eX]

[DOI]

CoRR, 2008

From lambda-Calculus to Universal Algebra and Back.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Lambda Theories of Effective Lambda Models.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

Easiness in graph models.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Boolean Algebras for Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2004

The Lattice of Lambda Theories.

[BibT_eX]

[DOI]

Stefania Lusin

J. Log. Comput., 2004

The Sensible Graph Theories of Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2003

Topological incompleteness and order incompleteness of the lambda calculu.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

A Note on Absolutely Unorderable Combinatory Algebras.

[BibT_eX]

[DOI]

Stefania Lusin

J. Log. Comput., 2003

The Minimal Graph Model of Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2001

Nonmodularity Results for Lambda Calculus.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

Towards Lambda Calculus Order-Incompleteness.

[BibT_eX]

[DOI]

Proceedings of the Bohm's theorem: applications to Computer Science Theory, 2001

A Continuum of Theories of Lambda Calculus without Semantics.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000

On the algebraic models of lambda calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

A Finite Equational Axiomatization of the Functional Algebras for the Lambda Calculus.

[BibT_eX]

[DOI]

Robert Goldblatt

Inf. Comput., 1999

1998

Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1998

The variety of lambda abstraction algebras does not admit n-permutable congruences for all n.

[BibT_eX]

Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1996

Interpolation and Compactness in Categories of Pre-Institutions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1996

1995

Lambda Abstraction Algebras: Representation Theorems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

The abstract variable-binding calculus.

[BibT_eX]

[DOI]

Stud Logica, 1995

1993

A Representation Theorem for Lambda Abstraction Algebras.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Dimension-Complemented Lambda Abstraction Algebras.

[BibT_eX]

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992

Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

A Soft Stairway to Institutions.

[BibT_eX]

[DOI]

Proceedings of the Recent Trends in Data Type Specification, 1991

1990

Equational Type Logic.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Equational Calculi for Many-Sorted Algebras with Empty Carrier Sets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

On the Nature of TELLUS (a Typed Equational Logic Look over Uniform Specification).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

1984

First-order theories as many-sorted algebras.

[BibT_eX]

[DOI]