Call-by-value is dual to call-by-name
From MaRDI portal
Publication:5261275
DOI10.1145/944705.944723zbMATH Open1315.68060OpenAlexW2053198071MaRDI QIDQ5261275FDOQ5261275
Publication date: 2 July 2015
Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/944705.944723
Recommendations
- Call-by-Value Is Dual to Call-by-Name, Extended
- Term Rewriting and Applications
- scientific article; zbMATH DE number 1086682
- scientific article; zbMATH DE number 1948183
- Call-by-push-value: Decomposing call-by-value and call-by-name
- scientific article; zbMATH DE number 1456965
- Call-by-Name and Call-by-Value in Normal Modal Logic
- Call-By-Value, Again!
- scientific article; zbMATH DE number 512793
- A reflection on call-by-value
Curry-Howard correspondencelogicnatural deductionlambda calculussequent calculuslambda-mu calculusDe Morgan dual
Cited In (32)
- Intuitionistic Letcc via Labelled Deduction
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Strong normalization of classical natural deduction with disjunctions
- Galois connecting call-by-value and call-by-name
- CPS-translation as adjoint
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Title not available (Why is that?)
- Abstracting models of strong normalization for classical calculi
- Call-by-Value Is Dual to Call-by-Name, Extended
- Call-by-name reduction and cut-elimination in classical logic
- Call-by-value combinatory logic and the lambda-value calculus
- Classical Logic with Mendler Induction
- Title not available (Why is that?)
- Categorical proof theory of classical propositional calculus
- Normalization in the simply typed -calculus
- Investigations on the dual calculus
- A Classical Sequent Calculus with Dependent Types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Focalisation and Classical Realisability
- Call-by-Name and Call-by-Value in Normal Modal Logic
- Dual Calculus with Inductive and Coinductive Types
- Term Rewriting and Applications
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
- Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less)
- Title not available (Why is that?)
- On the unity of duality
- On the computational representation of classical logical connectives
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Title not available (Why is that?)
- Classical (co)recursion: Mechanics
- Classical \(F_{\omega}\), orthogonality and symmetric candidates
This page was built for publication: Call-by-value is dual to call-by-name
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261275)
