The following pages link to The duality of computation (Q2943375):
Displaying 50 items.
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Justification logic as a foundation for certifying mobile computation (Q408548) (← links)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Kripke models for classical logic (Q636371) (← links)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) (Q636376) (← links)
- The \(\lambda \)-calculus and the unity of structural proof theory (Q733755) (← links)
- Symmetric categorial grammar (Q843772) (← links)
- Categorical proof theory of classical propositional calculus (Q860833) (← links)
- Combining algebraic effects with continuations (Q879352) (← links)
- Continuation semantics for the Lambek-Grishin calculus (Q964491) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← links)
- The proof monad (Q974136) (← links)
- On the form of witness terms (Q982183) (← links)
- Focusing and polarization in linear, intuitionistic, and classical logics (Q1035706) (← links)
- Classical realizability in the CPS target language (Q1744381) (← links)
- Classical natural deduction for S4 modal logic (Q1758660) (← links)
- Polarized games (Q1886321) (← links)
- Parametric parameter passing \(\lambda\)-calculus (Q1887148) (← links)
- Proof nets for classical logic (Q1982017) (← links)
- Abstracting models of strong normalization for classical calculi (Q2291828) (← links)
- Quantitative classical realizability (Q2343127) (← links)
- Classical \(F_{\omega}\), orthogonality and symmetric candidates (Q2482840) (← links)
- Strong normalization of classical natural deduction with disjunctions (Q2482841) (← links)
- Call-by-name reduction and cut-elimination in classical logic (Q2482842) (← links)
- On the unity of duality (Q2482843) (← links)
- Investigations on the dual calculus (Q2503329) (← links)
- Declarative representation of proof terms (Q2655330) (← links)
- Call-By-Push-Value from a Linear Logic Point of View (Q2802478) (← links)
- Classical By-Need (Q2802497) (← links)
- Adjunction Models For Call-By-Push-Value With Stacks (Q2842825) (← links)
- On the Computational Representation of Classical Logical Connectives (Q2864215) (← links)
- Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I (Q2866803) (← links)
- Probabilistic operational semantics for the lambda calculus (Q2905328) (← links)
- Dualized Simple Type Theory (Q2974773) (← links)
- A Classical Sequent Calculus with Dependent Types (Q2988668) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- A Filter Model for the λμ-Calculus (Q3007668) (← links)
- Covert Movement in Logical Grammar (Q3013021) (← links)
- Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
- A formal language for cyclic operads (Q3121012) (← links)
- Open Call-by-Value (Q3179293) (← links)
- Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) (Q3188293) (← links)
- (Q3384877) (← links)
- Call-by-Value Is Dual to Call-by-Name, Extended (Q3498450) (← links)
- Control reduction theories: the benefit of structural substitution (Q3503192) (← links)
- The Logic of Proofs as a Foundation for Certifying Mobile Computation (Q3605521) (← links)
- Dual Calculus with Inductive and Coinductive Types (Q3636828) (← links)
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (Q3637192) (← links)
- On the Values of Reducibility Candidates (Q3637200) (← links)
- A Logically Saturated Extension of ${{\bar\lambda\mu\tilde{\mu}}}$ (Q3637295) (← links)
