Interactive models of computation and program behavior
zbMATH Open1205.03045MaRDI QIDQ3564946FDOQ3564946
Authors: Pierre-Louis Curien, Hugo Herbelin, Jean-Louis Krivine, Paul-André Melliès 
Publication date: 27 May 2010
Recommendations
proof theoryCurry-Howard correspondencegame semanticslinear logicrealizabilitycategorical modelsabstract machines
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Categorical logic, topoi (03G30) Categorical semantics of formal languages (18C50) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cited In (11)
- Generation of interaktive animations of computational models
- Resource modalities in tensor logic
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- Title not available (Why is that?)
- Computational Interpretations of Classical Linear Logic
- POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE
- Ordered combinatory algebras and realizability
- The parametric continuation monad
- Title not available (Why is that?)
- Non-linearity as the metric completion of linearity
- On interaction, continuations and defunctionalization
This page was built for publication: Interactive models of computation and program behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564946)
