Call-by-Value Separability and Computability

@inproceedings{Paolini2001CallbyValueSA,
  title={Call-by-Value Separability and Computability},
  author={Luca Paolini},
  booktitle={ICTCS},
  year={2001}
}
  • Luca Paolini
  • Published in ICTCS 2001
  • Mathematics, Computer Science
The aim of this paper is to study the notion of separability in the call-by-value setting.Separability is the key notion used in the Bohm Theorem, proving that syntactically different s?-normal forms are separable in the classical ?-calculus endowed with s-reduction, i.e. in the call-by-name setting. In the case of call-by-value ?-calculus endowed with s? -reduction and ?? -reduction (see Plotkin [7]), it turns out that two syntactically different s?-normal forms are separable too, while the… Expand
16 Citations

Topics from this paper

A Semantical and Operational Account of Call-by-Value Solvability
  • 41
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  • 15
  • PDF
Open Call-by-Value
  • 29
  • Highly Influenced
  • PDF
Open Call-by-Value (Extended Version)
  • 2
  • Highly Influenced
  • PDF
Standardization of a Call-By-Value Lambda-Calculus
  • 18
  • PDF
Call-by-Value Solvability, Revisited
  • 33
  • PDF
An approach to call-by-name delimited continuations
  • 35
  • PDF
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
  • 9
  • PDF
Revisiting Call-by-value Bohm trees in light of their Taylor expansion
  • 10
  • PDF
...
1
2
...

References

SHOWING 1-7 OF 7 REFERENCES
Call-by-value Solvability
  • 48
  • PDF
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
  • 1,060
  • PDF
The lambda calculus - its syntax and semantics
  • H. Barendregt
  • Mathematics, Computer Science
  • Studies in logic and the foundations of mathematics
  • 1985
  • 3,692
The Mechanical Evaluation of Expressions
  • 1,023
  • PDF