Functionality in Combinatory Logic
From MaRDI portal
Publication:4758660
DOI10.1073/pnas.20.11.584zbMath0010.24201OpenAlexW1973312452WikidataQ33740589 ScholiaQ33740589MaRDI QIDQ4758660
Publication date: 1934
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.20.11.584
Related Items
ProofViz: an interactive visual proof explorer ⋮ Substructural Proofs as Automata ⋮ Intersection type assignment systems ⋮ Systems of illative combinatory logic complete for first-order propositional and predicate calculus ⋮ From realizability to induction via dependent intersection ⋮ Meaning and computing: two approaches to computable propositions ⋮ Conflation Confers Concurrency ⋮ Comparing cubes of typed and type assignment systems ⋮ Homotopy type theory and Voevodsky’s univalent foundations ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Extending the Curry-Howard interpretation to linear, relevant and other resource logics ⋮ Type inference for rank-2 intersection types using set unification ⋮ Adding Negation to Lambda Mu ⋮ Structural rules and algebraic properties of intersection types ⋮ Quantitative weak linearisation ⋮ Adding logic to the toolbox of molecular biology ⋮ Questions as information types ⋮ Observed Communication Semantics for Classical Processes ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Complete restrictions of the intersection type discipline ⋮ A light-weight integration of automated and interactive theorem proving ⋮ Cut-elimination in the strict intersection type assignment system is strongly normalizing ⋮ Logic of subtyping ⋮ Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ π-RED+ An interactive compiling graph reduction system for an applied λ-calculus ⋮ Normalization, approximation, and semantics for combinator systems ⋮ Why ramify? ⋮ On modal logics of partial recursive functions
