Add to ORKGComunicação apresentada em SBLP'00, Proc. 4th Brazilian Symposium on Programming Languages, Recife, May, 2000Recursive schemes over inductive data structures have been recognized as category-theoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals in the CAMILA prototyping language. Several examples are discussed
. Higher-order programming languages, such as ML, permit a flexible programming style by using compi...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
AbstractInferring types for polymorphic recursive function definitions (abbreviated to polymorphic r...
This article proposes a new framework for a polytypic extension of functional programming languages....
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
This paper is concerned with the construction of basic building blocks for polytypic programming. A ...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
AbstractThe idea of polytypic programming is to write programs that are defined by induction on the ...
Many functions have to be written over and over again for different datatypes, either because dataty...
Inferring types for polymorphic recursive function definitions (abbreviated to polymorphic recursion...
Generic programming aims to increase the flexibility of programming languages, by expanding the poss...
AbstractGenericity is the idea that the same program can work at many different data types. Longo, M...
We explore ideal models for a programming language with recursive polymorphic types, variants of the...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
. Higher-order programming languages, such as ML, permit a flexible programming style by using compi...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
AbstractInferring types for polymorphic recursive function definitions (abbreviated to polymorphic r...
This article proposes a new framework for a polytypic extension of functional programming languages....
A functional polytypic program is one that is parameterised by datatype. Since polytypic functions a...
This paper is concerned with the construction of basic building blocks for polytypic programming. A ...
Modem functional languages feature polymorphic types whose data structures must be fixed, though the...
Many algorithms have to be implemented over and over again for different datatypes, either because d...
AbstractThe idea of polytypic programming is to write programs that are defined by induction on the ...
Many functions have to be written over and over again for different datatypes, either because dataty...
Inferring types for polymorphic recursive function definitions (abbreviated to polymorphic recursion...
Generic programming aims to increase the flexibility of programming languages, by expanding the poss...
AbstractGenericity is the idea that the same program can work at many different data types. Longo, M...
We explore ideal models for a programming language with recursive polymorphic types, variants of the...
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functio...
. Higher-order programming languages, such as ML, permit a flexible programming style by using compi...
The theory and practice of polytypic programming is intimately connected with the initial algebra ...
AbstractInferring types for polymorphic recursive function definitions (abbreviated to polymorphic r...