Call-by-Value solvability, revisitedReport as inadecuate

Call-by-Value solvability, revisited - Download this document for free, or read online. Document in PDF available to download.

1 PARSIFAL - Proof search and reasoning with logic specifications LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau, Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161 2 LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau 3 Dipartimento di Informatica Torino

Abstract : In the call-by-value lambda-calculus solvable terms have been characterised by means of call-by-name reductions, which is disappointing and requires complex reasonings. We introduce the value substitution lambda-calculus, a simple calculus borrowing ideas from Herbelin and Zimmerman-s call-by-value lambda-CBV calculus and from Accattoli and Kesner-s substitution calculus lambda-sub. In this new setting, we characterise solvable terms as those terms having normal form with respect to a suitable restriction of the rewriting relation.

Author: Beniamino Accattoli - Luca Paolini -



Related documents