An operational characterization of strong normalization

Authors:
Luca Paolini;Elaine Pimentel;Simona Ronchi Della Rocca
Affiliations:
Dipartimento di Informatica, Università di Torino (Italy);Departamento de Matemática;Dipartimento di Informatica, Università di Torino (Italy)
Venue:
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Year:
2006

Citing 7
Cited 3

Type theories, normal forms, and D∞-lambda-models

Information and Computation
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
Call-by-Value Separability and Computability

ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Parametric parameter passing λ-calculus

Information and Computation
The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)

The Parametric Lambda Calculus: A Meta-Model for Computation (Texts in Theoretical Computer Science)
Lazy Strong Normalization

Electronic Notes in Theoretical Computer Science (ENTCS)

Calculi, types and applications

Theoretical Computer Science
Parametric λ-theories

Theoretical Computer Science
Strong normalization from an unusual point of view

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the Φ-calculus, a new call-by-value version of the λ-calculus, following the spirit of Plotkin's λβv-calculus. The Φ-calculus satisfies some interesting properties, in particular that its set of solvable terms coincides with the set of β-strongly normalizing terms in the classical λ-calculus.