## A Category-theoretic characterization of functional completeness (1990)

Citations: | 2 - 1 self |

### BibTeX

@MISC{Longo90acategory-theoretic,

author = {Giuseppe Longo and Eugenio Moggi},

title = {A Category-theoretic characterization of functional completeness},

year = {1990}

}

### OpenURL

### Abstract

. Functional languages are based on the notion of application: programs may be applied to data or programs. By application one may define algebraic functions; and a programming language is functionally complete when any algebraic function f(x 1 ,...,x n ) is representable (i.e. there is a constant a such that f(x 1 ,...,x n ) = (a . x 1 . ... . x n ). Combinatory Logic is the simplest type-free language which is functionally complete. In a sound category-theoretic framework the constant a above may be considered as an "abstract gödel-number" for f, when gödel-numberings are generalized to "principal morphisms", in suitable categories. By this, models of Combinatory Logic are categorically characterized and their relation is given to lambda-calculus models within Cartesian Closed Categories. Finally, the partial recursive functionals in any finite higher type are shown to yield models of Combinatory Logic. ________________ (+) Theoretical Computer Science, 70 (2), 1990, pp.193-211. A p...