The Calculi of Lambda Conversion. (AM-6)

DOI10.1515/9781400881932zbMATH Open0026.24205OpenAlexW4248334295MaRDI QIDQ5781187FDOQ5781187

Authors: Alonzo Church 

Publication date: 1941

Full work available at URL: https://doi.org/10.1515/9781400881932

zbMATH Keywords

Philosophy, logic

Cited In (25)

• Strong normalization from an unusual point of view
• High-level modelling for typed functional programming
• First-Order Logic Without Bound Variables: Compositional Semantics
• The Equivalence of Complete Reductions
• Inter-deriving semantic artifacts for object-oriented programming
• Kripke, Quine and Steiner on Representing Natural Numbers in Set Theory
• Degrees of Computability
• Embedding Markov normal algorithms within the λ-calculus
• A chemical abstract machine for graph reduction extended abstract
• Higher-order substitutions
• Title not available (Why is that?)
• Homotopy type theory and Voevodsky’s univalent foundations
• Computing tools and representations of arithmetic
• From Boolean algebra to unified algebra
• Title not available (Why is that?)
• General semantics
• Title not available (Why is that?)
• Core Type Theory
• Title not available (Why is that?)
• Folding left and right matters: Direct style, accumulators, and continuations
• Why ramify?
• Title not available (Why is that?)
• Parallel beta reduction is not elementary recursive
• Positive logic and \(\lambda\)-constants
• Combinator operations

This page was built for publication: The Calculi of Lambda Conversion. (AM-6)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5781187)