Call-by-push-value: Decomposing call-by-value and call-by-name
From MaRDI portal
(Redirected from Publication:857915)
Recommendations
Cites work
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 4179333 (Why is no real title available?)
- scientific article; zbMATH DE number 1330443 (Why is no real title available?)
- scientific article; zbMATH DE number 1342282 (Why is no real title available?)
- scientific article; zbMATH DE number 1948165 (Why is no real title available?)
- scientific article; zbMATH DE number 1497780 (Why is no real title available?)
- scientific article; zbMATH DE number 1549510 (Why is no real title available?)
- scientific article; zbMATH DE number 2172969 (Why is no real title available?)
- A fully abstract semantics for a higher-order functional language with nondeterministic computation
- Adjunction models for call-by-push-value with stacks
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Classical logic, continuation semantics and abstract machines
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- Inductive, coinductive, and pointed types
- Intensional interpretations of functionals of finite type I
- Jumbo λ-Calculus
- LCF considered as a programming language
- Notions of computation and monads
- Operational reasoning for functions with local state
- The lambda calculus, its syntax and semantics
- Thunks and the λ-calculus
Cited in
(44)- Unifying graded and parameterised monads
- Focused linear logic and the \(\lambda\)-calculus
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- On the relations between monadic semantics
- A reflection on call-by-value
- Encoding tight typing in a unified framework
- Galois connecting call-by-value and call-by-name
- The polarized \(\lambda\)-calculus
- Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
- Streams of approximations, equivalence of recursive effectful programs
- Polarized games
- scientific article; zbMATH DE number 7243675 (Why is no real title available?)
- Polarized subtyping
- Amb Breaks Well-Pointedness, Ground Amb Doesn't
- Quantitative logics for equivalence of effectful programs
- Taylor expansion, finiteness and strategies
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
- Plotkin's call-by-value \(\lambda\)-calculus as a modal calculus
- Factorization in call-by-name and call-by-value calculi via linear logic
- A coherent differential PCF
- Call-by-value combinatory logic and the lambda-value calculus
- Infinite trace equivalence
- The functional machine calculus
- Hefty algebras: modular elaboration of higher-order effects
- The bang calculus and the two Girard's translations
- The bang calculus revisited
- Iteration and labelled iteration
- Semi-axiomatic sequent calculus
- scientific article; zbMATH DE number 7566074 (Why is no real title available?)
- Call-by-value is dual to call-by-name
- The bang calculus revisited
- scientific article; zbMATH DE number 2120508 (Why is no real title available?)
- Mirroring call-by-need, or values acting silly
- Adjoint natural deduction
- Realisability semantics of parametric polymorphism, general references and recursive types
- Adjunction models for call-by-push-value with stacks
- Latent Effects for Reusable Language Components
- Sharing and linear logic with restricted access
- Big step normalisation for type theory
- Higher order functions and Brouwer's thesis
- Relational graph models at work
- From call-by-value to interaction by typed closure conversion
- Implementing open call-by-value
- scientific article; zbMATH DE number 7533346 (Why is no real title available?)
This page was built for publication: Call-by-push-value: Decomposing call-by-value and call-by-name
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857915)
