Year: 2005
Type: article
Abstract: Among all the reduction strategies for the untyped λ-calculus, the so called lazy β-evaluation is of particular interest due to its large applicability to functional programming languages (e.g. Haskell [Bird, R., “Introduction to Functional Programming using Haskell,” Series in Computer Science (2nd edition), Prentice Hall, (1998)]). This strategy reduces only redexes not inside a lambda abstraction. The lazy strongly β- normalizing terms are the λ-terms that don't have infinite lazy β-reduction sequences. This paper presents a logical characterization of lazy strongly β-normalizing terms using intersection types. This characterization, besides being interesting by itself, allows an interesting connection between call-by-name and call-by-value λ-calculus. In fact, it turns out that the class of lazy strongly β-normalizing terms coincides with that of call-by-value potentially valuable terms. This last class is of particular interest since it is a key notion for characterizing solvability in the call-by-value setting.
Institutions: University of Turin, Universidade Federal de Minas Gerais
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2104819922
