Characterising Strong Normalisation for Explicit Substitutions

Authors:
Steffen van Bakel;Mariangiola Dezani-Ciancaglini
Affiliations:
-;-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 12
Cited 2

Typing and computational properties of lambda expressions

Theoretical Computer Science
Type systems for programming languages

Handbook of theoretical computer science (vol. B)
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Lambda-calculus, types and models

Lambda-calculus, types and models
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Foundations of programming languages

Foundations of programming languages
Domains and lambda-calculi

Domains and lambda-calculi
Compositional Characterizations of lambda-Terms Using Intersection Types

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Typed lambda-calculi with explicit substitutions may not terminate

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Characterising Explicit Substitutions which Preserve Termination

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms

Journal of Functional Programming
Reductions, intersection types, and explicit substitutions

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Intersection types for explicit substitutions

Information and Computation
Calculi, types and applications

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We characterise the strongly normalising terms of a composition-free calculus of explicit substitutions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a cut-rule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.