Log In Sign Up

A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version)

by   José Espírito Santo, et al.

We introduce a call-by-name lambda-calculus λ J with generalized applications which integrates a notion of distant reduction that allows to unblock β-redexes without resorting to the permutative conversions of generalized applications. We show strong normalization of simply typed terms, and we then fully characterize strong normalization by means of a quantitative typing system. This characterization uses a non-trivial inductive definition of strong normalization –that we relate to others in the literature–, which is based on a weak-head normalizing strategy. Our calculus relates to explicit substitution calculi by means of a translation between the two formalisms which is faithful, in the sense that it preserves strong normalization. We show that our calculus λ J and the well-know calculus Λ J determine equivalent notions of strong normalization. As a consequence, Λ J inherits a faithful translation into explicit substitutions, and its strong normalization can be characterized by the quantitative typing system designed for λ J, despite the fact that quantitative subject reduction fails for permutative conversions.


page 1

page 2

page 3

page 4


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

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

Functional Pearl: The Distributive λ-Calculus

We introduce a simple extension of the λ-calculus with pairs—called the ...

A strong call-by-need calculus

We present a call-by-need λ-calculus that enables strong reduction (that...

Factoring Derivation Spaces via Intersection Types (Extended Version)

In typical non-idempotent intersection type systems, proof normalization...

Combinatorics of explicit substitutions

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

Towards the average-case analysis of substitution resolution in λ-calculus

Substitution resolution supports the computational character of β-reduct...

Weighted and Branching Bisimilarities from Generalized Open Maps

In the open map approach to bisimilarity, the paths and their runs in a ...