DeepAI AI Chat
Log In Sign Up

Strict Ideal Completions of the Lambda Calculus

by   Patrick Bahr, et al.

The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of strictness. To obtain infinitary normalisation and infinitary confluence properties for these calculi, Kennaway et al. extend β-reduction with infinitely many `-rules', which contract meaningless terms directly to . Three of the resulting Böhm reduction calculi have unique infinitary normal forms corresponding to Böhm-like trees. In this paper we develop a corresponding theory of infinitary lambda calculi based on ideal completion instead of metric completion. We show that each of our calculi conservatively extends the corresponding metric-based calculus. Three of our calculi are infinitarily normalising and confluent; their unique infinitary normal forms are exactly the Böhm-like trees of the corresponding metric-based calculi. Our calculi dispense with the infinitely many -rules of the metric-based calculi. The fully non-strict calculus (called 111) consists of only β-reduction, while the other two calculi (called 001 and 101) require two additional rules that precisely state their strictness properties: λ x.→ (for 001) and M → (for 001 and 101).


page 1

page 2

page 3

page 4


Taylor Expansion Finitely Simulates Infinitary β-Reduction

Originating in Girard's Linear logic, Ehrhard and Regnier's Taylor expan...

Probabilistic Rewriting: Relations between Normalization, Termination, and Unique Normal Forms

We investigate how techniques from Rewrite Theory can help us to study c...

An Abstract Machine for Strong Call by Value

We present an abstract machine that implements a full-reducing (a.k.a. s...

Revisiting Call-by-value Bohm trees in light of their Taylor expansion

The call-by-value lambda calculus can be endowed with permutation rules,...

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture

The main observational equivalences of the untyped lambda-calculus have ...

Combinatorics of explicit substitutions

λυ is an extension of the λ-calculus which internalises the calculus of ...

On reduction and normalization in the computational core

We study the reduction in a lambda-calculus derived from Moggi's computa...