Combinatory logic. With two sections by William Craig.

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Combinatory logic and lambda calculus (03B40)

Cited In (only showing first 100 items - show all)

Title not available (Why is that?)
Composition of deductions within the propositions-as-types paradigm
Conservation and uniform normalization in lambda calculi with erasing reductions
Syntactic type soundness results for the region calculus
Category theory based on combinatory logic
A new way of normalizing intuitionistic propositional logic
Revisiting the notion of function
The Equivalence of Complete Reductions
Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach
A verified framework for higher-order uncurrying optimizations
Title not available (Why is that?)
Effective longest and infinite reduction paths in untyped λ-calculi
Some models of combinatory logic
Intuitive counterexamples for constructive fallacies
ASMs and operational algorithmic completeness of lambda calculus
Constructive mathematics, Church's thesis, and free choice sequences
Algebraic and Logical Operations on Operators One Application to Semantic Computation
OTTER experiments in a system of combinatory logic
POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE
Standard and Normal Reductions
Non-well-founded sets via revision rules
Combinatory logic with polymorphic types
Schönfinkel-type operators for classical logic
Call-by-value combinatory logic and the lambda-value calculus
A modern elaboration of the ramified theory of types
A canonical locally named representation of binding
Term-space semantics of typed lambda calculus
Synchronization and computing capabilities of linear asynchronous structures
The tree-generative capacity of combinatory categorial grammars
Realizability in ordered combinatory algebras with adjunction
Finite generation and presentation problems for lambda calculus and combinatory logic
(Head-)normalization of typeable rewrite systems
Asymptotic Properties of Combinatory Logic
The systematic construction of a one-combinator basis for lambda-terms
Some remarks about the connections between Combinatory Logic and axiomatic recursion theory
Intersection and union types
On explicit substitution with names
Proof-functional connectives and realizability
Curry's formalism as structuralism
The harmony of identity
Combinatory recursive objects of all finite types
Coquand's calculus of constructions: A mathematical foundation for a proof development system
The word problem for Smullyan's lark combinator is decidable
Second-order properties of undirected graphs
Why Sets?
Reductions of Residuals are Finite
Covert movement in logical grammar
Simplex sigillum veri: Peano, Frege, and Peirce on the Primitives of Logic
Combinator operations
On principal types of combinators
Intuitionistic completeness of first-order logic
Condensed detachment is complete for relevance logic: A computer-aided proof
Completeness of the normal typed fragment of the \(\lambda\)-system \(U\)
Spaces with combinators
CARNAP’S DEFENSE OF IMPREDICATIVE DEFINITIONS
The future of logic: foundation-independence
Type inference with recursive types: Syntax and semantics
Lax Theory Morphisms
Types of I-free hereditary right maximal terms
The heart of intersection type assignment: Normalisation proofs revisited
On a machine-checked proof for fraction arithmetic over a GCD domain
Principal types of BCK-lambda-terms
State-transition machines for lambda-calculus expressions
Do-it-yourself type theory
A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
Introduction to Type Theory
Explicit substitutions with de bruijn's levels
Semantics for dual and symmetric combinatory calculi
Type theory and concurrency
Equivalence of bar recursors in the theory of functionals of finite type
Propositions and specifications of programs in Martin-Löf's type theory
A Gentzen-style sequent calculus of constructions with expansion rules
Normal forms in combinatory logic
THF0 – The Core of the TPTP Language for Higher-Order Logic
Normalization, approximation, and semantics for combinator systems
Logic of determination of objects (LDO): how to articulate ``extension with ``intension and ``objects with ``concepts
From IF to BI. A tale of dependence and separation
Algorithmic reduction of biological networks with multiple time scales
Logic of subtyping
The \(\lambda \)-calculus and the unity of structural proof theory
Type theories, normal forms, and \(D_{\infty}\)-lambda-models
Polymorphic type inference and containment
Title not available (Why is that?)
A new theory of quantifiers and term connectives
A solution to Curry and Hindley's problem on combinatory strong reduction
The semantics of entailment omega
Implementing a computer algebra system in Haskell
Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
A CUCH-machine: The automatic treatment of bound variables
Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
Approximation and normalization results for typeable term rewriting systems
Applications of type theory
About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
Communicating contexts: A pragmatic approach to information exchange
Intersection types and computational rules
λ-definierbare Funktionen auf Peanoalgebren
Combinatory logic and the semantics of substructural logics
Krivine machines and higher-order schemes
Constructive Game Logic
Intuitionistic categorial grammar

This page was built for publication: Combinatory logic. With two sections by William Craig.

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