Results 1 
4 of
4
Parametric and TypeDependent Polymorphism
, 1995
"... Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order systems and, thus, he proposes a "relational" treatment of invariance: computations do not depend on types in the sense that they are "invariant" w.r.t. arbitrary relations on types and between types. R ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order systems and, thus, he proposes a "relational" treatment of invariance: computations do not depend on types in the sense that they are "invariant" w.r.t. arbitrary relations on types and between types. Reynolds's approach set the basis for most of the current work on parametricity, as we will review below (.3). Some twelve years earlier, Girard had given just a simple hint towards another understanding of the properties of "computing with types". In [Gir71], it is shown, as a side remark, that, given a type A, if one defines a term J A such that, for any type B, J A B reduces to 1, if A = B, and reduces to 0, if A ¹ B, then F + J A does not normalize. In particular, then, J A is not definable in F. This remark on how terms may depend on types is inspired by a view of types which is quite different from Reynolds's. System F was born as the theory of proofs of second order intuitionis...
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 3 (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...
The Continuum: Foundations and Applications
, 1997
"... Most of the structures one deals with in Computer Science have a discrete and effective character: (finite) graphs, nets, trees in programming and formal languages, algorithms over finite strings or natural numbers, circuits etc... By continuous structures we mean "smooth" spaces, usually of cardina ..."
Abstract
 Add to MetaCart
Most of the structures one deals with in Computer Science have a discrete and effective character: (finite) graphs, nets, trees in programming and formal languages, algorithms over finite strings or natural numbers, circuits etc... By continuous structures we mean "smooth" spaces, usually of cardinality not less than continuum, where interesting topological or order properties give some information on, say, classes of functions over them. By discussing results from various areas of Mathematical Computer Science, we stress the role of continuous structures as tools for proving results about discrete or even finite structures. In particular we overview results concerning functionals in computability theory, trees in lambda calculus, boolean circuits in complexity theory and relate the finitary/combinatorial nature of the problems with their continuous solutions. We mostly focus on the methodology, and just hint to the technical aspects of the results presented. 2.1 Introduction In order...
Space and Time in the Foundations of Mathematics, or some challenges in the interactions with other sciences 1
"... Summary: Our relation to phenomenal space has been largely disregarded, and with good motivations, in the prevailing foundational analysis of Mathematics. The collapse of Euclidean certitudes, more than a century ago, excluded ‘’geometric judgments’ ’ from certainty and contributed, by this, to isol ..."
Abstract
 Add to MetaCart
Summary: Our relation to phenomenal space has been largely disregarded, and with good motivations, in the prevailing foundational analysis of Mathematics. The collapse of Euclidean certitudes, more than a century ago, excluded ‘’geometric judgments’ ’ from certainty and contributed, by this, to isolate the foundation of Mathematics from other disciplines. After the success of the logical approach, it is time to broaden our foundational tools and reconstruct, also in that respect, the interactions with other sciences. The way space (and time) organize knowledge is a crossdisciplinary issue that will be briefly examined in Mathematical Physics, Computer Science and Biology. This programmatic paper focuses on an epistemological approach to foundations, at the core of which is the analysis of the ‘’knowledge process’’, as a constitutive path from cognitive experiences to mathematical concepts and structures. Contents: