Call-by-value Solvability
From MaRDI portal
Recommendations
Cites work
- A filter lambda model and the completeness of type assignment
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- scientific article; zbMATH DE number 92599 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The Mechanical Evaluation of Expressions
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
Cited in
(27)- System \(T\), call-by-value and the minimum problem
- Parametric parameter passing \(\lambda\)-calculus
- Implementing open call-by-value
- Call-by-value solvability, revisited
- Linearity, non-determinism and solvability
- Open call-by-value
- Revisiting call-by-value Böhm trees in light of their Taylor expansion
- scientific article; zbMATH DE number 2044494 (Why is no real title available?)
- A Fresh Look at the λ-Calculus
- Modules over monads and operational semantics (expanded version)
- 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
- Solvability = typability + inhabitation
- Solvability for generalized applications
- Strong call-by-value and multi types
- Light genericity
- Categorifying non-idempotent intersection types
- Factorize factorization
- Modules over monads and operational semantics
- Optimizing a non-deterministic abstract machine with environments
- Meaningfulness and genericity in a subsuming framework (invited talk)
- Genericity through stratification
- The benefits of diligence
- Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
- Proof nets and the call-by-value \(\lambda\)-calculus
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
This page was built for publication: Call-by-value Solvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953339)
