On combinatory complete sets of proper combinators

• Tipo: Artigo em Revista Científica Internacional
• Data: 1997

Autores

Broda, S (Autor) FCUP; Damas, L (Autor) FCUP

Revista

Título: Journal of Functional Programming

Vol. 7

Páginas: 593-612

ISSN: 0956-7968

Editora: Cambridge University Press

Indexação

ISI Web of Knowledge

Scopus - 1 Citação

Outras Informações

ID Authenticus: P-007-7N9

Abstract (EN): 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.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 20