The Lattice of Lambda Theories

Authors:
Stefania Lusin;Antonino Salibra
Affiliations:
Dipartimento di Informatica, Università Ca'Foscari di Venezia, Via Torino 155, 30172 Venezia, Italy. E-mail: slusin@dsi.unive.it, salibra@dsi.unive.it;Dipartimento di Informatica, Università Ca'Foscari di Venezia, Via Torino 155, 30172 Venezia, Italy. E-mail: slusin@dsi.unive.it, salibra@dsi.unive.it
Venue:
Journal of Logic and Computation
Year:
2004

Citing 0
Cited 11

Intersection types and domain operators

Theoretical Computer Science - Logic, semantics and theory of programming
Graph models of $\lambda$-calculus at work, and variations

Mathematical Structures in Computer Science
Easiness in graph models

Theoretical Computer Science - Algebraic methods in language processing
From λ-Calculus to Universal Algebra and Back

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

Theoretical Computer Science
Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Effective λ-models versus recursively enumerable λ-theories

Mathematical Structures in Computer Science
Resource combinatory algebras

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Decomposing the lattice of meaningless sets in the infinitary lambda calculus

WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Capture-avoiding substitution as a nominal algebra

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Scott is always simple

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lambda theories are equational extensions of the untyped lambda calculus that are closed under derivation. The set of lambda theories is naturally equipped with a structure of complete lattice, where the meet of a family of lambda theories is their intersection, and the join is the least lambda theory containing their union. In this paper we study the structure of the lattice of lambda theories by universal algebraic methods. We show that nontrivial quasi-identities in the language of lattices hold in the lattice of lambda theories, while every nontrivial lattice identity fails in the lattice of lambda theories if the language of lambda calculus is enriched by a suitable finite number of constants. We also show that there exists a sublattice of the lattice of lambda theories which satisfies: (i) a restricted form of distributivity, called meet semidistributivity; and (ii) a nontrivial identity in the language of lattices enriched by the relative product of binary relations.