scientific article; zbMATH DE number 512771
From MaRDI portal
Publication:4281464
zbMATH Open0788.68016MaRDI QIDQ4281464FDOQ4281464
Authors: Franco Barbanera, Stefano Berardi 
Publication date: 10 March 1994
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 2095713
- Constructive classical logic as CPS-calculus
- Unifying classical and intuitionistic logics for computational control
- scientific article; zbMATH DE number 4047193
- scientific article; zbMATH DE number 1500568
- Embedding and automating conditional logics in classical higher-order logic
- The proof-theoretical analysis of contraction-less relevant logics
- scientific article; zbMATH DE number 1531362
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Narrowing and rewriting logic: from foundations to applications
Theory of programming languages (68N15) Formal languages and automata (68Q45) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40) First-order arithmetic and fragments (03F30)
Cited In (16)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classical truth in higher types
- Classical extraction in continuation models
- A type-theoretic foundation of delimited continuations
- A proof-theoretic foundation of abortive continuations
- Title not available (Why is that?)
- Search algorithms in type theory
- Domain-free \(\lambda\mu\)-calculus
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
- Title not available (Why is that?)
- Refined program extraction from classical proofs
- A strong normalization result for classical logic
- Uniform Heyting arithmetic
- Strong normalizability of the non-deterministic catch/throw calculi
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281464)
