Abstract. Infinite lambda calculi extend finite lambda calculus with infinite terms and transfinite reduction. In this paper we extend some classical results of finite lambda calculus to infinite terms. The first result we extend to infinite terms is Böhm Theorem which states the separability of two finite βη-normal forms. The second result we extend to infinite terms is the equivalence of the prefix relation up to infinite eta expansions and the contextual preorder that observes head normal forms. Finally we prove that the theory given by equality of ∞η-Böhm trees is the largest theory induced by the confluent and normalising infinitary lambda calculi extending the calculus of Böhm trees.
AbstractWe present an introduction to infinitary lambda calculus, highlighting its main properties. ...
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
We address a problem connected to the unfolding semantics of functional programming languages: give ...
Abstract. We show the existence of an infinitary confluent and nor-malising extension of the finite ...
In this paper we introduce a strong form of eta reduction called etabang that we use to construct a ...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a...
Abstract. This paper studies continuity of the normal form and the context operators as functions in...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
textabstractInfinite normal forms are a way of giving semantics to non-terminating rewrite systems. ...
We investigate the relationship between finite terms in λletrec, the lambda calculus with letrec, an...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
We treat a general technique to obtain Church - Rosser extensions of the lambda-beta-calculus, based...
AbstractWe present an introduction to infinitary lambda calculus, highlighting its main properties. ...
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
We address a problem connected to the unfolding semantics of functional programming languages: give ...
Abstract. We show the existence of an infinitary confluent and nor-malising extension of the finite ...
In this paper we introduce a strong form of eta reduction called etabang that we use to construct a ...
Recent work on infinitary versions of the lambda calculus has shown that the infinite lambda calculu...
AbstractRecent work on infinitary versions of the lambda calculus has shown that the infinite lambda...
Gabbay and Pitts proved that lambda-terms up to alphaequivalence constitute an initial algebra for a...
Abstract. This paper studies continuity of the normal form and the context operators as functions in...
In a previous paper we have established the theory of transfinite reduction for orthogonal term rewr...
AbstractIn a previous paper we have established the theory of transfinite reduction for orthogonal t...
textabstractInfinite normal forms are a way of giving semantics to non-terminating rewrite systems. ...
We investigate the relationship between finite terms in λletrec, the lambda calculus with letrec, an...
The main observational equivalences of the untyped lambda-calculus have been characterized in terms ...
We treat a general technique to obtain Church - Rosser extensions of the lambda-beta-calculus, based...
AbstractWe present an introduction to infinitary lambda calculus, highlighting its main properties. ...
We present an introduction to infinitary lambda calculus, highlighting its main properties. Subseque...
We address a problem connected to the unfolding semantics of functional programming languages: give ...