Classical \(F_{\omega}\), orthogonality and symmetric candidates

DOI10.1016/j.apal.2008.01.005zbMath1135.03007OpenAlexW2074767526MaRDI QIDQ2482840

Stéphane Lengrand, Alexandre Miquel

Publication date: 24 April 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.01.005

zbMATH Keywords

classical logicclassical version of system \(F_{\omega}\)

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Unnamed Item ⋮ Orthogonality and Boolean Algebras for Deduction Modulo ⋮ Abstracting models of strong normalization for classical calculi ⋮ Focalisation and Classical Realisability ⋮ Quantitative classical realizability

Uses Software

• Automath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• The lambda calculus, its syntax and semantics
• A symmetric lambda calculus for classical program extraction
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Why the usual candidates of reducibility do not work for the symmetric $\lambda\mu$-calculus
• The duality of computation
• A new type assignment for λ-terms
• Introduction to generalized type systems
• Call-by-value is dual to call-by-name
• Foundations of Software Science and Computation Structures
• Strong Normalization of the Dual Classical Sequent Calculus
• Typed Lambda Calculi and Applications

This page was built for publication: Classical \(F_{\omega}\), orthogonality and symmetric candidates