Call-by-Value Solvability, Revisited

@inproceedings{Accattoli2012CallbyValueSR,
  title={Call-by-Value Solvability, Revisited},
  author={Beniamino Accattoli and Luca Paolini},
  booktitle={FLOPS},
  year={2012}
}
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… Expand
33 Citations
A Semantical and Operational Account of Call-by-Value Solvability
  • 41
  • Highly Influenced
  • PDF
Head reduction and normalization in a call-by-value lambda-calculus
  • 15
  • PDF
Standardization of a Call-By-Value Lambda-Calculus
  • 18
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  • 15
  • PDF
Proof nets and the call-by-value lambda-calculus
  • 8
  • PDF
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value
  • 31
  • PDF
Proof nets and the call-by-value λ-calculus
  • 22
  • PDF
Open Call-by-Value
  • 29
  • PDF
Open Call-by-Value (Extended Version)
  • 2
  • PDF
New Semantical Insights Into Call-by-Value λ-Calculus
  • 1
  • PDF
...
1
2
3
4
...

References

SHOWING 1-10 OF 48 REFERENCES
Call-by-value Solvability
  • 48
  • PDF
Call-by-Value lambda-calculus and LJQ
  • 12
  • PDF
Sound and Complete Axiomatisations of Call-by-Value Control Operators
  • M. Hofmann
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1995
  • 43
Call-by-Value Separability and Computability
  • 16
Labelled Lambda-calculi with Explicit Copy and Erase
  • 4
  • PDF
Linearity, Non-determinism and Solvability
  • 27
  • PDF
Computational lambda-calculus and monads
  • E. Moggi
  • Mathematics, Computer Science
  • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
  • 1,026
  • PDF
Extensional Rewriting with Sums
  • 346
  • PDF
...
1
2
3
4
5
...