Classical realizability in the CPS target language
From MaRDI portal
Publication:1744381
Recommendations
Cites work
- A call-by-name lambda-calculus machine
- A new constructive logic: classic logic
- A semantics of evidence for classical arithmetic
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Classical logic, continuation semantics and abstract machines
- Computational ludics
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- Dual-intuitionistic logic
- Existential witness extraction in classical realizability and via a negative translation
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- scientific article; zbMATH DE number 3970744 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 1231584 (Why is no real title available?)
- Locus solum: From the rules of logic to the logic of rules.
- On full abstraction for PCF: I, II and III
- On the unity of duality
- Realizability toposes from specifications
- Resource modalities in tensor logic
- The duality of computation
- The duality of computation under focus
- The stack calculus
- Tripos theory
This page was built for publication: Classical realizability in the CPS target language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744381)