Results 1  10
of
28
Graph lambda theories
 Journal of Logic and Computation
, 2004
"... 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 theo ..."
Abstract

Cited by 22 (13 self)
 Add to MetaCart
(Show Context)
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 quasiidentities 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.
The sensible graph theories of lambda calculus
 IN: 19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS’04), IEEE COMPUTER
, 2004
"... Sensible λtheories are equational extensions of the untyped lambda calculus that equate all the unsolvable λterms and are closed under derivation. A longstanding open problem in lambda calculus is whether there exists a nonsyntactic model whose equational theory is the least sensible λtheory H (g ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
(Show Context)
Sensible λtheories are equational extensions of the untyped lambda calculus that equate all the unsolvable λterms and are closed under derivation. A longstanding open problem in lambda calculus is whether there exists a nonsyntactic model whose equational theory is the least sensible λtheory H (generated by equating all the unsolvable terms). A related question is whether, given a class of models, there exist a minimal and maximal sensible λtheory represented by it. In this paper we give a positive answer to this question for the semantics of lambda calculus given in terms of graph models. We conjecture that the least sensible graph theory, where “graph theory ” means “λtheory of a graph model”, is equal to H, while in the main result of the paper we characterize the greatest sensible graph theory as the λtheory B generated by equating λterms with the same Böhm tree. This result is a consequence of the fact that all the equations between solvable λterms, which have different Böhm trees, fail in every sensible graph model. Further results of the paper are: (i) the existence of a continuum of different sensible graph theories strictly included in B (this result positively answers Question 2 in [7, Section 6.3]); (ii) the nonexistence of a graph model whose equational theory is exactly the minimal lambda theory λβ (this result negatively answers Question 1 in [7, Section 6.2] for the restricted class of graph models).
The Minimal Graph Model of Lambda Calculus
"... A longstanding open problem in lambdacalculus, raised by G.Plotkin, is whether there exists a continuous model of the untyped lambdacalculus whose theory is exactly the betatheory or the betaetatheory. A related question, raised recently by C.Berline, is whether, given a class of lambdamode ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
(Show Context)
A longstanding open problem in lambdacalculus, raised by G.Plotkin, is whether there exists a continuous model of the untyped lambdacalculus whose theory is exactly the betatheory or the betaetatheory. A related question, raised recently by C.Berline, is whether, given a class of lambdamodels, there is a minimal equational theory represented by it.
Boolean algebras for lambda calculus
 21TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2006), IEEE COMPUTER
, 2006
"... In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebra of central elements (playing the role of idempotent elements in rings), whose operations are defined by suitable combin ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
(Show Context)
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebra of central elements (playing the role of idempotent elements in rings), whose operations are defined by suitable combinators. Central elements are used to represent any combinatory algebra as a Boolean product of directly indecomposable combinatory algebras (i.e., algebras which cannot be decomposed as the Cartesian product of two other nontrivial algebras). Central elements are also used to provide applications of the representation theorem to lambda calculus. We show that the indecomposable semantics (i.e., the semantics of lambda calculus given in terms of models of lambda calculus, which are directly indecomposable as combinatory algebras) includes the continuous, stable and strongly stable semantics, and the term models of all semisensible lambda theories. In one of the main results of the paper we show that the indecomposable semantics is equationally incomplete, and this incompleteness is as wide as possible: for every recursively enumerable lambda theory T, there is a continuum of lambda theories including T which are omitted by the indecomposable semantics.
Lambda theories of effective lambda models
 In 16th EACSL Annual Conference on Computer Science and Logic (CSL’07), LNCS
, 2007
"... Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped λcalculus whose theory is exactly the least λtheory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λcalculus can be recu ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped λcalculus whose theory is exactly the least λtheory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λcalculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λcalculus, which covers in particular all the models individually introduced in the literature. We prove that the order theory of an effective model is never r.e.; from this it follows that its equational theory cannot be λβ, λβη. We then show that no effective model living in the stable or strongly stable semantics has an r.e. equational theory. Concerning Scott’s semantics, we investigate the class of graph models and prove that no order theory of a graph model can be r.e., and that there exists an effective graph model whose equational/order theory is the minimum one. Finally, we show that the class of graph models enjoys a kind of downwards LöwenheimSkolem theorem.
Vries. Order Structures for Böhmlike models
 In CSL, volume 3634 of LNCS
, 2005
"... Abstract. We are interested in the question whether the models induced by the infinitary lambda calculus are orderable, that is whether they have a partial order with a least element making the context operators monotone. The first natural candidate is the prefix relation: a prefix of a term is ob ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
Abstract. We are interested in the question whether the models induced by the infinitary lambda calculus are orderable, that is whether they have a partial order with a least element making the context operators monotone. The first natural candidate is the prefix relation: a prefix of a term is obtained by replacing some subterms by ⊥. We prove that six models induced by the infinitary lambda calculus (which includes Böhm and LévyLongo trees) are orderable by the prefix relation. The following two orders we consider are the compositions of the prefix relation with either transfinite ηreduction or transfinite ηexpansion. We prove that these orders make the context operators of the ηBöhm trees and the∞ηBöhm trees monotone. The model of Berarducci trees is not monotone with respect to the prefix relation. However, somewhat unexpectedly, we found that the Berarducci trees are orderable by a new order related to the prefix relation in which subterms are not replaced by ⊥ but by a lambda term O called the ogre which devours all its inputs. The proof of this uses simulation and coinduction. Finally, we show that there are 2c unorderable models induced by the infinitary lambda calculus where c is the cardinality of the continuum. 1
Infinite rewriting: from syntax to semantics
 In Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday
, 2005
"... Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriti ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Rewriting is the repeated transformation of a structured object according to a set of rules. This simple concept has turned out to have a rich variety of elaborations, giving rise to many different theoretical frameworks for reasoning about computation. Aside from its theoretical importance, rewriting has also
Applying Universal Algebra to Lambda Calculus
, 2007
"... The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λtheories ( = equational extensions of untyped λcalculus) and the models of lambda calculus via universal algebra. This includes positive or negative answers to se ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λtheories ( = equational extensions of untyped λcalculus) and the models of lambda calculus via universal algebra. This includes positive or negative answers to several questions raised in these years as well as several independent results, the state of the art about the longstanding open questions concerning the representability of λtheories as theories of models, and 26 open problems. On the other side, against the common belief, we show that lambda calculus and combinatory logic satisfy interesting algebraic properties. In fact the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras and λabstraction algebras. In every combinatory and λabstraction algebra there is a Boolean algebra of central elements (playing the role of idempotent elements in rings). Central elements are used to represent any combinatory and λabstraction algebra as a weak Boolean product of directly indecomposable algebras (i.e., algebras which cannot be decomposed as the Cartesian product of two other nontrivial algebras). Central elements are also used to provide applications of the representation theorem to lambda calculus. We show that the indecomposable semantics (i.e., the semantics of lambda calculus given in terms of models of lambda calculus, which are directly indecomposable as combinatory algebras) includes the continuous, stable and strongly stable semantics, and the term models of all semisensible λtheories. In one of the main results of the paper we show that the indecomposable semantics is equationally incomplete, and this incompleteness is as wide as possible.
Reflexive domains are not complete for the extensional lambda calculus
 Proc. of LICS’09, IEEE Computer Society Publications
"... Reflexive domains are not complete for the extensional λcalculus ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Reflexive domains are not complete for the extensional λcalculus
Lambda calculus: models and theories
 Proceedings of the Third AMAST Workshop on Algebraic Methods in Language Processing (AMiLP2003), number 21 in TWLT Proceedings, pages 39–54, University of Twente, 2003. Invited Lecture
"... In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λtheories, the equational incompleteness of lambda calculus semantics, and the λtheories in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λtheories, the equational incompleteness of lambda calculus semantics, and the λtheories induced by graph models of lambda calculus.