Combinatory logic. With two sections by William Craig.
From MaRDI portal
(Redirected from Publication:769601)
Cited in
(only showing first 100 items - show all)- Cut-elimination in the strict intersection type assignment system is strongly normalizing
- Une nouvelle C-réduction dans la logique combinatoire
- On the semantics of polymorphism
- Intuitionistic completeness of first-order logic
- Structural rules and algebraic properties of intersection types
- Composition of deductions within the propositions-as-types paradigm
- Conservation and uniform normalization in lambda calculi with erasing reductions
- scientific article; zbMATH DE number 4168913 (Why is no real title available?)
- Syntactic type soundness results for the region calculus
- Condensed detachment is complete for relevance logic: A computer-aided proof
- A new way of normalizing intuitionistic propositional logic
- Category theory based on combinatory logic
- Completeness of the normal typed fragment of the -system U
- Spaces with combinators
- scientific article; zbMATH DE number 7559299 (Why is no real title available?)
- Constructive game logic
- The future of logic: foundation-independence
- Type inference with recursive types: Syntax and semantics
- Types of I-free hereditary right maximal terms
- The heart of intersection type assignment: Normalisation proofs revisited
- Three faces of natural deduction
- Revisiting the notion of function
- Towards logical foundations for probabilistic computation
- On a machine-checked proof for fraction arithmetic over a GCD domain
- Principal types of BCK-lambda-terms
- The Equivalence of Complete Reductions
- State-transition machines for lambda-calculus expressions
- A verified framework for higher-order uncurrying optimizations
- Do-it-yourself type theory
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Evolving combinators
- Linear numeral systems
- Some models of combinatory logic
- The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: a proof via corresponding calculus
- Introduction to Type Theory
- scientific article; zbMATH DE number 7243672 (Why is no real title available?)
- Effective longest and infinite reduction paths in untyped λ-calculi
- Semantics for dual and symmetric combinatory calculi
- Constructive mathematics, Church's thesis, and free choice sequences
- ASMs and operational algorithmic completeness of lambda calculus
- Explicit substitutions with de bruijn's levels
- Intuitive counterexamples for constructive fallacies
- Type theory and concurrency
- Algebraic and Logical Operations on Operators One Application to Semantic Computation
- Propositions and specifications of programs in Martin-Löf's type theory
- Equivalence of bar recursors in the theory of functionals of finite type
- A Gentzen-style sequent calculus of constructions with expansion rules
- Classical realizability and arithmetical formulæ
- The cube generalizing Aristotle's square in logic of determination of objects (LDO)
- Syntactic type soundness for the region calculus
- Normal forms in combinatory logic
- Paracompositionality, MWEs and argument substitution
- Point-fixe sur un ensemble restreint
- A confluent reduction for the extensional typed \(\lambda\)-calculus with pairs, sums, recursion and terminal object
- Normalization, approximation, and semantics for combinator systems
- THF0 – The Core of the TPTP Language for Higher-Order Logic
- Logic of determination of objects (LDO): how to articulate ``extension with ``intension and ``objects with ``concepts
- OTTER experiments in a system of combinatory logic
- Asymptotic properties of combinatory logic
- Spiritus asper versus lambda: on the nature of functional abstraction
- From IF to BI. A tale of dependence and separation
- Mengentheoretische Modelle desλK-Kalküls
- Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey
- Algorithmic reduction of biological networks with multiple time scales
- Logic of subtyping
- Combinatory categorial grammars as generators of weighted forests
- The \(\lambda \)-calculus and the unity of structural proof theory
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Polymorphic type inference and containment
- Non-well-founded sets via revision rules
- Combinatory logic with polymorphic types
- Standard and Normal Reductions
- Propositional forms of judgemental interpretations
- Objectivity and truth in mathematics: a sober non-Platonist perspective
- Carnap's defense of impredicative definitions
- Schönfinkel-type operators for classical logic
- A new theory of quantifiers and term connectives
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
- A solution to Curry and Hindley's problem on combinatory strong reduction
- Lax theory morphisms
- Extracting a DPLL algorithm
- A modern elaboration of the ramified theory of types
- Call-by-value combinatory logic and the lambda-value calculus
- scientific article; zbMATH DE number 3827824 (Why is no real title available?)
- The semantics of entailment omega
- Term-space semantics of typed lambda calculus
- AI, ME and Lewis (abelian implication, material equivalence and C I Lewis 1920)
- A canonical locally named representation of binding
- Synchronization and computing capabilities of linear asynchronous structures
- First-order logic without bound variables: compositional semantics
- The tree-generative capacity of combinatory categorial grammars
- Implementing a computer algebra system in Haskell
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
- scientific article; zbMATH DE number 3489105 (Why is no real title available?)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023
- Computing tools and representations of arithmetic
- Realizability in ordered combinatory algebras with adjunction
- Types for modules
- Finite generation and presentation problems for lambda calculus and combinatory logic
- A glimpse into the paradise of combinatory algebra
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)
