A Semantical and Operational Account of Call-by-Value Solvability
From MaRDI portal
Recommendations
- Call-by-value solvability, revisited
- Call-by-value Solvability
- The call-by-value λ-calculus: a semantic investigation
- scientific article; zbMATH DE number 2044494
- New semantical insights into call-by-value \(\lambda\)-calculus
- Sound and complete axiomatisations of call-by-value control operators
- A relational account of call-by-value sequentiality
- On the call-by-value CPS transform and its semantics
- Regular-language semantics for a call-by-value programming language
- Call-by-value non-determinism in a linear logic type discipline
Cited in
(42)- System \(T\), call-by-value and the minimum problem
- The bang calculus revisited
- The spirit of node replication
- A relational account of call-by-value sequentiality
- Call-By-Push-Value from a Linear Logic Point of View
- 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 4156407 (Why is no real title available?)
- Solvability in resource lambda-calculus
- scientific article; zbMATH DE number 177801 (Why is no real title available?)
- scientific article; zbMATH DE number 1948165 (Why is no real title available?)
- scientific article; zbMATH DE number 2044494 (Why is no real title available?)
- Relational graph models at work
- Call-by-value Solvability
- Towards a semantic measure of the execution time in call-by-value lambda-calculus
- A Fresh Look at the λ-Calculus
- Tight typings and split bounds, fully developed
- New semantical insights into call-by-value \(\lambda\)-calculus
- Head reduction and normalization in a call-by-value lambda-calculus
- On reduction and normalization in the computational core
- Z property for the shuffling calculus
- Extended call-by-push-value: reasoning about effectful programs and evaluation order
- The bang calculus revisited
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- Node Replication: Theory And Practice
- Quantitative global memory
- Solvability for generalized applications
- Strong call-by-value and multi types
- Light genericity
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Categorifying non-idempotent intersection types
- Factorize factorization
- Mirroring call-by-need, or values acting silly
- Meaningfulness and genericity in a subsuming framework (invited talk)
- A quantitative approach to global state composition
- 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
- Mirroring call-by-need, or values acting silly
- Proof nets and the call-by-value \(\lambda\)-calculus
This page was built for publication: A Semantical and Operational Account of Call-by-Value Solvability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5410667)
