Call-by-Value -calculus and LJQ

DOI10.1093/logcom/exm037zbMath1133.03030OpenAlexW1995430920MaRDI QIDQ5441124

Roy Dyckhoff, Stéphane Lengrand

Publication date: 7 February 2008

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exm037

zbMATH Keywords

sequent calculussemanticsintuitionistic logiclambda calculuscall-by-valuecontinuation-passing

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)

Related Items (7)

Proof checking and logic programming ⋮ Open Call-by-Value ⋮ A short proof that adding some permutation rules to \(\beta \) preserves SN ⋮ A semantic framework for proof evidence ⋮ Monadic translation of classical sequent calculus ⋮ Proof Checking and Logic Programming ⋮ A Fresh Look at the λ-Calculus

This page was built for publication: Call-by-Value  -calculus and LJQ