Skip to Main content Skip to Navigation
Conference papers

Call-by-Value solvability, revisited

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-00780358
Contributor : Beniamino Accattoli Connect in order to contact the contributor
Submitted on : Wednesday, January 23, 2013 - 5:39:29 PM
Last modification on : Monday, February 7, 2022 - 4:06:03 PM
Long-term archiving on: : Wednesday, April 24, 2013 - 4:00:12 AM

File

FLOPS2012.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00780358, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

122

Files downloads

271