Interactive models of computation and program behavior
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)
- Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
- scientific article; zbMATH DE number 2185717 (Why is no real title available?)
- On the relation of interaction semantics to continuations and defunctionalization
- Computational Interpretations of Classical Linear Logic
- Non-linearity as the metric completion of linearity
- On interaction, continuations and defunctionalization
- Resource modalities in tensor logic
- Generation of interaktive animations of computational models
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- scientific article; zbMATH DE number 980418 (Why is no real title available?)
- The parametric continuation monad
- Ordered combinatory algebras and realizability
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)