Skip to main content
Conference ProceedingsOPEN ACCESS

An operational characterization of strong normalization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 3921 LNCS 367-381
DOI: 10.1007/11690634_25
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Paolini, L., Pimentel, E., & Ronchi Della Rocca, S. (2006). An operational characterization of strong normalization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3921 LNCS, pp. 367–381). https://doi.org/10.1007/11690634_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free