The Calculi of Lambda Conversion. (AM-6)
From MaRDI portal
Publication:5781187
DOI10.1515/9781400881932zbMath0026.24205OpenAlexW4248334295MaRDI QIDQ5781187
Publication date: 1941
Full work available at URL: https://doi.org/10.1515/9781400881932
Related Items (24)
A chemical abstract machine for graph reduction extended abstract ⋮ High-level modelling for typed functional programming ⋮ From Boolean algebra to unified algebra ⋮ Unnamed Item ⋮ Homotopy type theory and Voevodsky’s univalent foundations ⋮ Folding left and right matters: Direct style, accumulators, and continuations ⋮ Kripke, Quine and Steiner on Representing Natural Numbers in Set Theory ⋮ Core Type Theory ⋮ Embedding Markov normal algorithms within the λ-calculus ⋮ Unnamed Item ⋮ Strong normalization from an unusual point of view ⋮ Inter-deriving semantic artifacts for object-oriented programming ⋮ Combinator operations ⋮ Unnamed Item ⋮ Positive logic and \(\lambda\)-constants ⋮ Unnamed Item ⋮ First-Order Logic Without Bound Variables: Compositional Semantics ⋮ Degrees of Computability ⋮ General semantics ⋮ Higher-order substitutions ⋮ Parallel beta reduction is not elementary recursive ⋮ Why ramify? ⋮ The Equivalence of Complete Reductions ⋮ Unnamed Item
This page was built for publication: The Calculi of Lambda Conversion. (AM-6)