Corpus ID: 11446985

Open Call-by-Value (Extended Version)

@article{Accattoli2016OpenC,
  title={Open Call-by-Value (Extended Version)},
  author={Beniamino Accattoli and Giulio Guerrieri},
  journal={ArXiv},
  year={2016},
  volume={abs/1609.00322}
}
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are required, and it is well known that the operational semantics of call-by-value becomes problematic in this case. Here we study the intermediate setting -- that we call Open Call-by-Value -- of weak evaluation with open terms, on top of which Gregoire and… Expand
2 Citations
Open Call-by-Value
  • 29
  • PDF
Eager Functions as Processes
  • 9
  • PDF

References

SHOWING 1-10 OF 44 REFERENCES
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
  • 1,060
  • Highly Influential
  • PDF
A Semantical and Operational Account of Call-by-Value Solvability
  • 41
  • PDF
Lazy Strong Normalization
  • 10
  • Highly Influential
  • PDF
The Duality of Computation under Focus
  • 38
  • PDF
On the Value of Variables
  • 24
  • PDF
Call-by-Value Solvability, Revisited
  • 33
  • PDF
The weak lambda calculus as a reasonable machine
  • 42
  • PDF
Call-by-Value Separability and Computability
  • 16
  • Highly Influential
Proof nets and the call-by-value λ-calculus
  • 22
  • PDF
An Operational Account of Call-By-Value Minimal and Classical λ-calculus in ” Natural Deduction ” Form
  • 15
  • Highly Influential
  • PDF
...
1
2
3
4
5
...