Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Reasoning about programs in continuation-passing style
Lisp and Symbolic Computation - Special issue on continuations—part I
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
Call-by-Value Separability and Computability
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
On solvability by lambda I - terms
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
A survey of some useful partial order relations on terms of the lambda calculus
Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
A Factorisation Theorem in Rewriting Theory
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
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)
Call-by-Value λ-calculus and LJQ
Journal of Logic and Computation
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Jumping boxes: representing lambda-calculus boxes by jumps
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
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 λ CBV calculus and from Accattoli and Kesner's substitution calculus λ 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.