Call-by-value, call-by-name, and strong normalization for the classical sequent calculus
From MaRDI portal
Publication:2844073
zbMATH Open1270.68070MaRDI QIDQ2844073FDOQ2844073
Authors: Stéphane Lengrand 
Publication date: 27 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105826192
Recommendations
Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cited In (15)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Symmetric categorial grammar
- On semantics of a term calculus for classical logic
- Monadic Translation of Intuitionistic Sequent Calculus
- Abstracting models of strong normalization for classical calculi
- Call-by-name reduction and cut-elimination in classical logic
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
- Title not available (Why is that?)
- A formal equational theory for call-by-push-value
- Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
- Computation with classical sequents
- Kripke models for classical logic
- Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: extending the Coppo-Dezani heritage
- Strong Normalisation of Cut-Elimination That Simulates β-Reduction
- On the computational representation of classical logical connectives
This page was built for publication: Call-by-value, call-by-name, and strong normalization for the classical sequent calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844073)
