Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
APLApplicative computing systemsBeta normal formBinary combinatory logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Rejuvenating High Available Virtualized Systems
Virtualization technology in the form of server consolidation makes running of hot-standby replicas on one system possible, while… 
2004
2004
Combinatory Logic, Language, and Cognitive Representations
The aim of logic is not only a study of correct reasoning or a mathematical analysis of formal systems: 
2003
2003
An Efficient Dynamic Multi-Angular Feature Points Matcher for Catadioptric Views
A new efficient matching algorithm dedicated to catadioptric sensors is proposed in this paper. The presented approach is… 
2002
2002
Polytime, combinatory logic and positive safe induction
Abstract. We characterize the polynomial time operations as those which are provably total in a first order system, which… 
Highly Cited
2001
Highly Cited
2001
Frappé: Functional Reactive Programming in Java
Functional Reactive Programming (FRP) is a declarative programming model for constructing interactive applications based on a… 
1997
1997
Compact bracket abstraction in combinatory logic
Abstract Translations from Lambda calculi into combinatory logics can be used to avoid some implementational problems of the… 
1988
1988
Graphinators and the duality of SIMD and MIMD
Combinator reduction is a well-known implementation technique for executing functional programs. In this paper we present a new… 
Highly Cited
1985
Highly Cited
1985
Serial Combinators: "Optimal" Grains of Parallelism
A method is described for translating a high-level functional program into combinators suitable for execution on multiprocessors… 
Highly Cited
1975
Highly Cited
1975
Combinators and classes
  • D. Scott
  • Lambda-Calculus and Computer Science Theory
  • 1975
  • Corpus ID: 9728672
The paper tries to answer the question: What is the relation between class abstraction and λ-abstraction in models for the… 
1972
1972
A simplification of combinatory logic
The usual formulations of combinatory logic, as in Church [1] or Curry and Feys [2], have no straightforward semantics. This lack… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)