Hostname: page-component-cb9f654ff-qc88w Total loading time: 0 Render date: 2025-09-05T14:00:47.579Z Has data issue: false hasContentIssue false
  • English
  • Français

Perpetuality in a named lambda calculus with explicit substitutions

Published online by Cambridge University Press:  07 March 2001

EDUARDO BONELLI
EDUARDO BONELLI
Affiliation:
Laboratoire de Recherche en Informatique, Bât 490, Université de Paris-Sud, 91405, Orsay Cedex, France. Email: bonelli@lri.fr Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina.
Get access Rights & Permissions [Opens in a new window]

Abstract

We study perpetuality in the calculus of explicit substitutions λx. A reduction is called perpetual if it preserves the possibility of infinite reduction sequences. We then take a look at applications of this study: an inductive characterization of the λx-strongly normalizing terms, two perpetual reduction strategies for λx and finally a proof of strong normalization of a polymorphic lambda calculus with explicit substitutions Fes. To complete the study of Fes, the property of subject reduction is shown to hold by extending type assignments of the typing rules to allow non-pure types (types with possible occurrences of the type substitution operator).

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 11 , Issue 1 , February 2001 , pp. 47 - 90
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable