Call-by-value Solvability

@article{Paolini1999CallbyvalueS,
  title={Call-by-value Solvability},
  author={Luca Paolini and S. Rocca},
  journal={RAIRO Theor. Informatics Appl.},
  year={1999},
  volume={33},
  pages={507-534}
}
The notion of solvability in the call-by-value λ -calculus is defined and completely characterized, both from an operational and a logical point of view. The operational characterization is given through a reduction machine, performing the classical β -reduction, according to an innermost strategy. In fact, it turns out that the call-by-value reduction rule is too weak for capturing the solvability property of terms. The logical characterization is given through an intersection type assignment… Expand
48 Citations

Topics from this paper

Call-by-Value Solvability, Revisited
  • 33
  • PDF
A Semantical and Operational Account of Call-by-Value Solvability
  • 41
  • Highly Influenced
  • PDF
Call-by-Value Separability and Computability
  • 16
Proof nets and the call-by-value λ-calculus
  • 22
  • PDF
Proof nets and the call-by-value lambda-calculus
  • 8
  • PDF
Open Call-by-Value
  • 29
  • Highly Influenced
  • PDF
Standardization of a Call-By-Value Lambda-Calculus
  • 18
  • PDF
Types of Fireballs
  • 14
  • PDF
Open Call-by-Value (Extended Version)
  • 2
  • Highly Influenced
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
  • 15
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Call-by-Name, Call-by-Value and the lambda-Calculus
  • G. Plotkin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1975
  • 1,060
  • PDF
Introduction to combinators and λ-calculus
  • 577
Full Abstraction in the Lazy Lambda Calculus
  • 284
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
Haskell - the craft of functional programming
  • S. Thompson
  • Computer Science
  • International computer science series
  • 1996
  • 307
A Filter Lambda Model and the Completeness of Type Assignment
  • 570
...
1
2
3
4
...