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.

2013

Summary form only given. Hybrid systems are composed by continuous physical component and discrete control component where the…

2011

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

2005

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

2005

Constraint-Based Test data generation (CBT) exploits constraint satisfaction techniques to generate test data able to kill a…

2002

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

2002

Dynamic composition of services from components at runtime can help to provide flexible service infrastructures, but requires…

1997

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

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…

1970

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