Combinatory logic

Known as: Combinatory algebra, S (disambiguation), S combinator 
Combinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses Schönfinkel and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A theory of composition synthesis based on inhabitation in combinatory logic is described and illustrated with examples… (More)
  • figure 2
  • figure 8
  • figure 10
  • figure 13
  • figure 14
Is this relevant?
2013
2013
We show a model construction for a system of higher-order illative combinatory logic Iω, thus establishing its strong consistency… (More)
Is this relevant?
2012
2012
In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the… (More)
  • figure 3.1
  • figure 3.2
  • figure 5.2
  • figure 5.3
Is this relevant?
2011
2011
Combinatory logic is based on modus ponens and a schematic (polymorphic) interpretation of axioms. In this paper we propose to… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
  • 2010
One of the aims of combinatory logic is to study the most basic properties of functions and other concepts, with as few… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present an axiomatic framework for Girard’s Geometry of Interaction, based on the notion of linear combinatory algebra. We… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1997
Highly Cited
1997
perspective, labels represent an extra `informational resource' which is present in deduction and can play a variety of roles… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
II. Extensions of CPDL, or Applications of the Method. 1. Three simple extensions. 1.1. Determinism: CDPL. 1.2. Limited finite… (More)
Is this relevant?
1986
1986
Smullyan successfully poses some fairly deep theorems of combinatory logic in terms of these forests of birds. One of the authors… (More)
Is this relevant?