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.
Highly Cited
2015
Highly Cited
2015
Synthesizing data structure transformations from input-output examples
We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input… 
Highly Cited
2005
Highly Cited
2005
Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
We propose a novel approach to the well-known view update problem for the case of tree-structured data: a domain-specific… 
Highly Cited
1998
Highly Cited
1998
WebL - A Programming Language for the Web
Highly Cited
1996
Highly Cited
1996
Confluence properties of weak and strong calculi of explicit substitutions
Categorical combinators [Curien 1986/1993; Hardin 1989; Yokouchi 1989] and more recently λ&sgr;-calculus [Abadi 1991; Hardin and… 
Highly Cited
1991
Highly Cited
1991
mural: A Formal Development Support System
1General introduction.- 1.1 Formal methods.- 1.2 VDM development.- 1.3 The IPSE 2.5 project.- 1.4 Proof assistant requirements… 
Highly Cited
1991
Highly Cited
1991
The semantic foundations of concurrent constraint programming
Concurrent constraint programming [Sar89 ,SR90] is a simple and powerful model of concurrent computation based on the notions of… 
Highly Cited
1986
Highly Cited
1986
Introduction to Combinators and Lambda-Calculus
A solution to get the problem off, have you found it? Really? What kind of solution do you resolve the problem? From what sources… 
Highly Cited
1980
Highly Cited
1980
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Highly Cited
1976
Highly Cited
1976
An abstraction algorithm for combinatory logic
This note presents a practical algorithm for carrying out abstraction on combinatory terms. The well-known abstraction algorithms… 
Highly Cited
1960
Highly Cited
1960
Proving theorems by pattern recognition I
Certain preliminary results on doing mathematics by machines (“mechanical mathematics”) were reported in an earlier paper [20… 
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)