Computation with classical sequents
From MaRDI portal
Publication:3520146
DOI10.1017/S0960129508006762zbMATH Open1173.03011OpenAlexW2027556526MaRDI QIDQ3520146FDOQ3520146
Pierre Lescanne, Steffen Van Bakel
Publication date: 15 August 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129508006762
Recommendations
Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)
Cites Work
- Untersuchungen über das logische Schliessen. I
- Title not available (Why is that?)
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- A formulation of the simple theory of types
- A symmetric lambda calculus for classical program extraction
- Classical logic, storage operators and second-order lambda-calculus
- A new deconstructive logic: linear logic
- Lambda terms for natural deduction, sequent calculus and cut elimination
- Intersection types for explicit substitutions
Cited In (6)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Programming Languages and Systems
- Sequential operators in computability logic
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
- Theoretical Computer Science
- Semantic types and approximation for Featherweight Java
This page was built for publication: Computation with classical sequents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520146)
