Combinatory logic. With two sections by William Craig.
From MaRDI portal
Publication:769601
Cited in
(only showing first 100 items - show all)- Some remarks about the connections between Combinatory Logic and axiomatic recursion theory
- Intuitive counterexamples for constructive fallacies
- Algorithmic theories of problems. A constructive and a non-constructive approach
- Combinator operations
- ASMs and operational algorithmic completeness of lambda calculus
- On explicit substitution with names
- On principal types of combinators
- Combinatory logic with polymorphic types
- scientific article; zbMATH DE number 4168913 (Why is no real title available?)
- Proof-functional connectives and realizability
- Composition of deductions within the propositions-as-types paradigm
- Constructive mathematics, Church's thesis, and free choice sequences
- Covert movement in logical grammar
- Some models of combinatory logic
- Effective longest and infinite reduction paths in untyped λ-calculi
- The harmony of identity
- Synchronization and computing capabilities of linear asynchronous structures
- Coquand's calculus of constructions: A mathematical foundation for a proof development system
- Algebraic and Logical Operations on Operators One Application to Semantic Computation
- Asymptotic properties of combinatory logic
- A modern elaboration of the ramified theory of types
- Simplex sigillum veri: Peano, Frege, and Peirce on the Primitives of Logic
- Finite generation and presentation problems for lambda calculus and combinatory logic
- Intersection and union types
- Combinatory recursive objects of all finite types
- Conservation and uniform normalization in lambda calculi with erasing reductions
- Syntactic type soundness results for the region calculus
- The word problem for Smullyan's lark combinator is decidable
- Why Sets?
- The tree-generative capacity of combinatory categorial grammars
- OTTER experiments in a system of combinatory logic
- The systematic construction of a one-combinator basis for lambda-terms
- A verified framework for higher-order uncurrying optimizations
- Category theory based on combinatory logic
- Second-order properties of undirected graphs
- Curry's formalism as structuralism
- Schönfinkel-type operators for classical logic
- Standard and Normal Reductions
- Reductions of Residuals are Finite
- (Head-)normalization of typeable rewrite systems
- Revisiting the notion of function
- A canonical locally named representation of binding
- Call-by-value combinatory logic and the lambda-value calculus
- Realizability in ordered combinatory algebras with adjunction
- Term-space semantics of typed lambda calculus
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
- The Equivalence of Complete Reductions
- A new way of normalizing intuitionistic propositional logic
- scientific article; zbMATH DE number 7243672 (Why is no real title available?)
- Non-well-founded sets via revision rules
- Relevant predication. I: The formal theory
- Principal types of BCK-lambda-terms
- Type inference with recursive types: Syntax and semantics
- Applications of type theory
- The ``relevance of intersection and union types
- Semantics for dual and symmetric combinatory calculi
- Logic of determination of objects (LDO): how to articulate ``extension with ``intension and ``objects with ``concepts
- How to assign ordinal numbers to combinatory terms with polymorphic types
- Intuitionistic completeness of first-order logic
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- An epistemic logic for becoming informed
- From IF to BI. A tale of dependence and separation
- Positive logic and \(\lambda\)-constants
- State-transition machines for lambda-calculus expressions
- scientific article; zbMATH DE number 3827824 (Why is no real title available?)
- Normalization, approximation, and semantics for combinator systems
- Monadic pseudo BCI-algebras and corresponding logics
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
- Equivalence of bar recursors in the theory of functionals of finite type
- Intuitionistic categorial grammar
- Completeness of the normal typed fragment of the \(\lambda\)-system \(U\)
- New proofs of important theorems of untyped extensional \(\lambda\) calculus
- Algorithmic reduction of biological networks with multiple time scales
- Propositions and specifications of programs in Martin-Löf's type theory
- A CUCH-machine: The automatic treatment of bound variables
- Types of I-free hereditary right maximal terms
- The heart of intersection type assignment: Normalisation proofs revisited
- A new theory of quantifiers and term connectives
- A variadic extension of Curry's fixed-point combinator
- Normal forms in combinatory logic
- A decidable theory of type assignment
- Innovations in computational type theory using Nuprl
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- Spaces with combinators
- A solution to Curry and Hindley's problem on combinatory strong reduction
- The absence and the presence of fixed point combinators
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result
- Logic of subtyping
- Intersection types and computational rules
- Communicating contexts: A pragmatic approach to information exchange
- The \(\lambda \)-calculus and the unity of structural proof theory
- Combinatory logic and the semantics of substructural logics
- NP-completeness of a combinator optimization problem
- Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
- Type-theoretic logic with an operational account of intensionality
- A Gentzen-style sequent calculus of constructions with expansion rules
- On a machine-checked proof for fraction arithmetic over a GCD domain
- Carnap's defense of impredicative definitions
- scientific article; zbMATH DE number 3659565 (Why is no real title available?)
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)
