On combinatory complete sets of proper combinators

Authors:
Sabine Broda;Luís Damas
Affiliations:
DCC & LIACC, Universidade do Porto, R. do Campo Alegre 823, 4150 Porto, Portugal (e-mail: {sbb,luis}@ncc.up.pt);DCC & LIACC, Universidade do Porto, R. do Campo Alegre 823, 4150 Porto, Portugal (e-mail: {sbb,luis}@ncc.up.pt)
Venue:
Journal of Functional Programming
Year:
1997

Citing 3
Cited 0

BCK-combinators and linear &lgr;-terms have types

Theoretical Computer Science
Combinatory abstraction using B, B′ and friends

Theoretical Computer Science
Algebraic Semantics

Algebraic Semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A combinatory system (or equivalently the set of its basic combinators) is called combinatorially complete for a functional system, if any member of the latter can be defined by an entity of the former system. In this paper the decision problem of combinatory completeness for finite sets of proper combinators is studied for three subsystems of the pure lambda calculus. Precise characterizations of proper combinator bases for the linear and the affine λ-calculus are given, and the respective decision problems are shown to be decidable. Furthermore, it is determined which extensions with proper combinators of bases for the linear λ-calculus are combinatorially complete for the λI-calculus.