Monadic Translation of Intuitionistic Sequent Calculus

DOI10.1007/978-3-642-02444-3_7zbMath1246.03027OpenAlexW1867484958MaRDI QIDQ3638248

José Espírito Santo, Ralph Matthes, Luís Pinto

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02444-3_7

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Monadic translation of classical sequent calculus

Cites Work

• Unnamed Item
• Notions of computation and monads
• Strong normalization proofs by CPS-translations
• An equivalence between lambda- terms
• A reflection on call-by-value
• The duality of computation
• Completing Herbelin’s Programme
• The correspondence between cut-elimination and normalization
• Normalization as a homomorphic image of cut-elimination
• Foundations of Software Science and Computation Structures
• Delayed Substitutions
• Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
• Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi

This page was built for publication: Monadic Translation of Intuitionistic Sequent Calculus