Combinatory logic. With two sections by William Craig.
From MaRDI portal
(Redirected from Publication:769601)
Cited in
(only showing first 100 items - show all)- A solution to Curry and Hindley's problem on combinatory strong reduction
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Relevant predication. I: The formal theory
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Polymorphic type inference and containment
- The word problem for Smullyan's lark combinator is decidable
- Equivalence of bar recursors in the theory of functionals of finite type
- Type theory and concurrency
- Condensed detachment is complete for relevance logic: A computer-aided proof
- Coquand's calculus of constructions: A mathematical foundation for a proof development system
- The systematic construction of a one-combinator basis for lambda-terms
- Principal types of BCK-lambda-terms
- Combinator operations
- Completeness of the normal typed fragment of the -system U
- A new way of normalizing intuitionistic propositional logic
- Synchronization and computing capabilities of linear asynchronous structures
- Positive logic and -constants
- Some models of combinatory logic
- Proof-functional connectives and realizability
- Non-well-founded sets via revision rules
- The ``relevance of intersection and union types
- Revisiting the notion of function
- The semantics of entailment omega
- Generalized filter models
- A Gentzen-style sequent calculus of constructions with expansion rules
- On principal types of combinators
- Semantics for dual and symmetric combinatory calculi
- On the semantics of polymorphism
- Normalization, approximation, and semantics for combinator systems
- Syntactic type soundness results for the region calculus
- Conservation and uniform normalization in lambda calculi with erasing reductions
- OTTER experiments in a system of combinatory logic
- Normal forms in combinatory logic
- NP-completeness of a combinator optimization problem
- Logic of determination of objects (LDO): how to articulate ``extension with ``intension and ``objects with ``concepts
- Curry's formalism as structuralism
- Term-space semantics of typed lambda calculus
- Monadic pseudo BCI-algebras and corresponding logics
- Algorithmic reduction of biological networks with multiple time scales
- The tree-generative capacity of combinatory categorial grammars
- Constructive mathematics, Church's thesis, and free choice sequences
- Combinatory logic with polymorphic types
- Finite generation and presentation problems for lambda calculus and combinatory logic
- On a machine-checked proof for fraction arithmetic over a GCD domain
- Composition of deductions within the propositions-as-types paradigm
- Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment
- New proofs of important theorems of untyped extensional \(\lambda\) calculus
- The harmony of identity
- Logic of typical and atypical instances of a concept -- a mathematical model
- Linear numeral systems
- Why ramify?
- Intersection types and lambda models
- Types for modules
- A canonical locally named representation of binding
- On explicit substitution with names
- State-transition machines for lambda-calculus expressions
- AI, ME and Lewis (abelian implication, material equivalence and C I Lewis 1920)
- Logic of subtyping
- Proof-theoretic semantics for classical mathematics
- The lambda-gamma calculus: A language adequate for defining recursive functions
- A modern elaboration of the ramified theory of types
- About probability-like measures for entire theories
- The future of logic: foundation-independence
- Combinatory logic and the semantics of substructural logics
- Second-order properties of undirected graphs
- Asymptotic properties of combinatory logic
- On the logic of expansion in natural language
- Krivine machines and higher-order schemes
- Covert movement in logical grammar
- Extracting a DPLL algorithm
- Automath type inclusion in Barendregt's cube
- A new type assignment for λ-terms
- Objectivity and truth in mathematics: a sober non-Platonist perspective
- Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
- Category theory based on combinatory logic
- A glimpse into the paradise of combinatory algebra
- Intuitionistic categorial grammar
- scientific article; zbMATH DE number 4168913 (Why is no real title available?)
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- ASMs and operational algorithmic completeness of lambda calculus
- A decidable theory of type assignment
- scientific article; zbMATH DE number 3827824 (Why is no real title available?)
- Point-fixe sur un ensemble restreint
- scientific article; zbMATH DE number 3659565 (Why is no real title available?)
- Mengentheoretische Modelle desλK-Kalküls
- Intuitionistic completeness of first-order logic
- scientific article; zbMATH DE number 3489105 (Why is no real title available?)
- scientific article; zbMATH DE number 3509716 (Why is no real title available?)
- scientific article; zbMATH DE number 3514943 (Why is no real title available?)
- The Equivalence of Complete Reductions
- Some remarks about the connections between Combinatory Logic and axiomatic recursion theory
- Reductions of Residuals are Finite
- scientific article; zbMATH DE number 3605901 (Why is no real title available?)
- Standard and Normal Reductions
- A CUCH-machine: The automatic treatment of bound variables
- How to assign ordinal numbers to combinatory terms with polymorphic types
- Algorithmic theories of problems. A constructive and a non-constructive approach
- Simplex sigillum veri: Peano, Frege, and Peirce on the Primitives of Logic
- Three faces of natural deduction
- Categories of first-order quantifiers
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)
