Classical logic, storage operators and second-order lambda-calculus
From MaRDI portal
Publication:1326769
DOI10.1016/0168-0072(94)90047-7zbMath0814.03009MaRDI QIDQ1326769
Publication date: 13 June 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90047-7
classical logic; continuations; System F; storage operators; data type of natural numbers; head reduction; second-order lambda-calculus
Related Items
A new deconstructive logic: linear logic, Résultats de complétude pour des classes de types du système $\mathcal {AF}2$, A short proof of the strong normalization of classical natural deduction with disjunction, Entiers intuitionnistes et entiers classiques en $\lambda \, C$-calcul, Refined program extraction from classical proofs, A general storage theorem for integers in call-by-name \(\lambda\)- calculus, A semantical storage operator theorem for all types, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Uniform Heyting arithmetic, About classical logic and imperative programming, Completeness of continuation models for \(\lambda_\mu\)-calculus, Les types de données syntaxiques du système ${\cal F}$, Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique, Computation with classical sequents, Complete Types in an Extension of the System AF2
Cites Work
