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.

Review

2011

Review

2011

2007

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

2004

The aim of logic is not only a study of correct reasoning or a mathematical analysis of formal systems:

2003

A new efficient matching algorithm dedicated to catadioptric sensors is proposed in this paper. The presented approach is…

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…

1995

1988

The execution has been studied of four small and four medium‐sized SASL programs, when interpreted by a variant of Turner's…

1970

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