Characterisation of Strongly Normalising lambda-mu-Terms

@inproceedings{Bakel2012CharacterisationOS,
  title={Characterisation of Strongly Normalising lambda-mu-Terms},
  author={Steffen van Bakel and Franco Barbanera and Ugo de'Liguoro},
  booktitle={ITRS},
  year={2012}
}
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to represent the particular notion of continuation used in the literature for the definition of semantics for the lambda-mu-calculus. This makes it possible to lift the well-known characterisation property for strongly-normalising lambda-terms - that uses intersection… 

Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types

TLDR
A notion of approximants of lambda-mu-terms is defined, it is shown that it generates a semantics, and that for each typeable term there is an approximant that has the same type.

A Translation of Intersection and Union Types for the λμ-Calculus

TLDR
An intersection and union type system for the λμ-calculus is introduced, which includes a restricted version of the traditional union-elimination rule and the terms typable in the system coincide with the strongly normalising terms of the \(\overline\lambda\mu\widetilde\)-calculus.

32 : 2 Types as Resources for Classical Natural Deduction

We define two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial arguments –based

Types as Resources for Classical Natural Deduction

TLDR
Two resource aware typing systems for the λμ-calculus based on non-idempotent intersection and union types are defined and typability provides upper bounds for the length of head-reduction sequences and maximal reduction sequences.

Characterizing of Strong Normalization for Λμ-Calculus

λμ-calculus is introduced by Parigot as an extension isomorphic to an alternative presentation of classical natural deduction. Since then, many properties of it have been studied and, in particular,

Characterizing Strongly Normalizing λGtz-terms via Non-Idempotent Intersection Types

TLDR
This paper introduces a non-idempotent intersection system for λGtz-calculus, which is in sequent calculus style, to show that a λ Gtz-term is typeable if and only if it is strongly normalizing.

Intersection types and (positive) almost-sure termination

TLDR
It is shown that intersection types are capable of precisely characterizing both notions of termination inside a single system of types: the probability of convergence of any λ-term can be underapproximated by its type, while the underlying derivation's weight gives a lower bound to the term’s expected number of steps to normal form.

The approximation theorem for the Λμ-calculus

  • Ugo de'Liguoro
  • Mathematics
    Mathematical Structures in Computer Science
  • 2015
TLDR
An intersection type assignment system for de Groote–Saurin Λμ-calculus is introduced which is invariant under subject conversion and establishes the approximation theorem, stating that a type can be assigned to a term in the system if and only if it can be assign to same of its approximations.

References

SHOWING 1-10 OF 34 REFERENCES

Strict intersection types for the Lambda Calculus

This article will show the usefulness and elegance of strict intersection types for the Lambda Calculus, that are strict in the sense that they are the representatives of equivalence classes of types

A Filter Model for the λμ-Calculus - (Extended Abstract)

TLDR
An intersection type assignment system for the pure λμ- calculus, which is invariant under subject reduction and expansion, is introduced and it is shown that typed λ μ-terms in Parigot's system have a non-trivial intersection typing in this system.

A filter lambda model and the completeness of type assignment

In [6, p. 317] Curry described a formal system assigning types to terms of the type-free λ-calculus. In [11] Scott gave a natural semantics for this type assignment and asked whether a completeness

Sound and Complete Typing for lambda-mu

TLDR
This paper defines intersection and union type assignment for Parigot's calculus lambda-mu and shows that this notion is complete (i.e. closed under subject-expansion), and also shows that it is sound, which implies that this idea of intersection-union type assignment is suitable for a semantics.

On the Relations between the Syntactic Theories of lambda-mu-Calculi

TLDR
Four variants of call- by-name call-by-nameλμ-calculus are introduced, some results about reductions in λμ-Calculus are established and the relationships between the λ μ-calculi are investigated, and a type system is introduced to prove subject reduction and strong normalization.

A Symmetric Lambda Calculus for Classical Program Extraction

TLDR
The strong normalization property is proved to hold for such a calculus, as well as for its extension to a system equivalent to Peano arithmetic, and a theorem on the shape of terms in normal form makes it possible to get recursive functions out of proofs of recursive functions.

A Symmetric Lambda Calculus for "Classical" Program Extraction

TLDR
A theorem on the shape of terms in normal form is proved, making it possible to get recursive functions out of proofs of 6 02 formulas, i.e., those corresponding to program specifications.

Minimal Classical Logic and Control Operators

TLDR
An analysis of various classical axioms is given and a notion of minimal classical logic that enforces Peirce's law without enforcing Ex Falso Quodlibet is characterized, showing that a "natural" implementation of this logic is Parigot's classical natural deduction.

Classical logic, continuation semantics and abstract machines

TLDR
The goal of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines by studying the case of extensional untyped call-by-name λ-calculus with Felleisen's control operator.

On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control

TLDR
This work constructs a translation of first order λΜ-calculus into a subtheory of Felleisen's λc-Calculus, and shows that the two calculi are actually isomorphic.