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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

Basic principles of the theory and methodology of grammaticalization and of diachronic typology are brought to bear on three…

2007

Li and Zdancewic have recently proposed an approach to provide information-flow security via a library rather than producing a…

2005

Though there is considerable agreement among past studies about the great variability in conflict judgments by Air Traffic…

2002

Abstract. We characterize the polynomial time operations as those which are provably total in a first order system, which…

1997

Abstract Translations from Lambda calculi into combinatory logics can be used to avoid some implementational problems of the…

1996

We present a very general language for expressing tactic programs. The paper describes some essential tactic combinators…

1991

This paper studies ‘Fool's models’ of combinatory logic, and relates them to Hindley's ‘D-completeness’ problem. A ‘fool's model…

1985

The subject of the paper is the connection between the typed λ-calculus and the cartesian closed categories, pointed out by…

Highly Cited

1983

Highly Cited

1983

1970

In this paper, I present a modified and extended version of combinatory logic. Schönfinkel originated the study of combinatory…