Call-by-value separability and computability
From MaRDI portal
Recommendations
- Call-by-value solvability, revisited
- Call-by-value Solvability
- A Semantical and Operational Account of Call-by-Value Solvability
- scientific article; zbMATH DE number 512793
- Call-by-value non-determinism in a linear logic type discipline
- Call-by-value combinatory logic and the lambda-value calculus
- The call-by-value λ-calculus: a semantic investigation
- Call-by-Value -calculus and LJQ
- scientific article; zbMATH DE number 7650848
- Complexity of model-checking call-by-value programs
Cited in
(17)- System \(T\), call-by-value and the minimum problem
- An analysis of Böhm's theorem
- Game-theoretic analysis of call-by-value computation
- An abstract machine for strong call by value
- A relational account of call-by-value sequentiality
- Open call-by-value
- Revisiting call-by-value Böhm trees in light of their Taylor expansion
- A complete and decidable proof system for call-by-value equalities
- Possible world semantics for general storage in call-by-value
- Towards a semantic measure of the execution time in call-by-value lambda-calculus
- A Fresh Look at the λ-Calculus
- Head reduction and normalization in a call-by-value lambda-calculus
- Strong normalization from an unusual point of view
- A Semantical and Operational Account of Call-by-Value Solvability
- Strong call-by-value and multi types
- Light genericity
- Factorize factorization
This page was built for publication: Call-by-value separability and computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448358)
