Theoretical Computer Science
From MaRDI portal
Publication:5395064
DOI10.1007/11560586zbMath1171.68411OpenAlexW2603408665MaRDI QIDQ5395064
Pierre Lescanne, Stéphane Lengrand, Steffen van Bakel
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11560586
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)
Related Items
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types, Kripke models for classical logic, Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\), On the Computational Representation of Classical Logical Connectives