Computation with classical sequents
From MaRDI portal
Publication:3520146
Recommendations
Cites work
- scientific article; zbMATH DE number 3333259 (Why is no real title available?)
- A formulation of the simple theory of types
- A new deconstructive logic: linear logic
- A symmetric lambda calculus for classical program extraction
- Classical logic, storage operators and second-order lambda-calculus
- Intersection types for explicit substitutions
- Lambda terms for natural deduction, sequent calculus and cut elimination
- Linear logic
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The system \({\mathcal F}\) of variable types, fifteen years later
- Untersuchungen über das logische Schliessen. I
Cited in
(8)- On the computational representation of classical logical connectives
- Sequent calculus as a compiler intermediate language
- Theoretical Computer Science
- Programming Languages and Systems
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Sequential operators in computability logic
- Semantic types and approximation for Featherweight Java
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
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)