Results 1 
3 of
3
A Categorytheoretic characterization of functional completeness
, 1990
"... . 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 ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
. 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 typefree language which is functionally complete. In a sound categorytheoretic framework the constant a above may be considered as an "abstract gödelnumber" for f, when gödelnumberings are generalized to "principal morphisms", in suitable categories. By this, models of Combinatory Logic are categorically characterized and their relation is given to lambdacalculus 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.193211. A p...
Constructive Natural Deduction And Its "omegaSet" Interpretation
, 1990
"... . Various Theories of Types are introduced, by stressing the analogy "propositionsas types" : from propositional to higher order types (and Logic). In accordance with this, proofs are described as terms of various calculi, in particular of polymorphic (second order) l calculus. A semant ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
. Various Theories of Types are introduced, by stressing the analogy "propositionsas types" : from propositional to higher order types (and Logic). In accordance with this, proofs are described as terms of various calculi, in particular of polymorphic (second order) l calculus. A semantic explanation is then given by interpreting individual types and the collection of all types in two simple categories built out of the natural numbers (the modest sets and the universe of wsets). The first part of this paper (syntax) may be viewed as a short tutorial with a constructive understanding of the deduction theorem and some work on the expressive power of first and second order quantification. Also in the second part (semantics, .67) the presentation is meant to be elementary, even though we introduce some new facts on types as quotient sets in order to interpret "explicit polymorphism". (The experienced reader in Type Theory may directly go, at first reading, to .678). Content. Remark...
Reflections On Formalism And Reductionism In Logic And Computer Science
"... This report contains a preprint (paper 1) and a reprint (paper 2). The first develops some epistemological views which were hinted in the second, in particular by stressing the need of a greater role of geometric insight and images in foundational studies and in approaches to cognition. The second p ..."
Abstract
 Add to MetaCart
This report contains a preprint (paper 1) and a reprint (paper 2). The first develops some epistemological views which were hinted in the second, in particular by stressing the need of a greater role of geometric insight and images in foundational studies and in approaches to cognition. The second paper is the "philosophical" part of a lecture in Type Theory, whose technical sections, omitted here, have been largely subsumed by subsequent publications (see references). The part reprinted below discusses more closely some historical remarks recalled in paper 1. 1. Reflections on formalism and reductionism in Logic and Computer Science (pp. 1  9)