Skip to search boxSkip to navigationSkip to main content

Strict Ideal Completions of the Lambda Calculus

Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review

Open access

Publication Information

Output type

Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Peer-review

Original language

English

Article number

8

Pages from-to (Number of pages)

Pages 8:1-8:16 (16 pages)

Publication milestones

  • Published - 07/2018

Publication status

Published - 07/2018

Publisher

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH

Publication IDs

  • Scopus: 85049793691

Host publication title

3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)

Abstract

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 res- ulting 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 ex- tends 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 cor- responding 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).

Publication metrics

PlumX, opens in new tab

Captures
3
Citations
2

Related Event

Title

International Conference on Formal Structures for Computation and Deduction

Event type

Conference

Degree of recognition

International event

Date

09/07/2018 - 12/07/2018

Location

OxfordUnited Kingdom