Call-by-Value solvability, revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Call-by-Value solvability, revisited


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.
Fichier principal
Vignette du fichier
FLOPS2012.pdf (251.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00780358 , version 1 (23-01-2013)


  • HAL Id : hal-00780358 , version 1


Beniamino Accattoli, Luca Paolini. Call-by-Value solvability, revisited. 11th International Symposium on Functional and Logic Programming - FLOPS 2012, May 2012, Kobe, Japan. ⟨hal-00780358⟩
126 View
334 Download


Gmail Facebook Twitter LinkedIn More