Type parametric programming
Year: 2018
Type: dissertation
Abstract: We introduce a new abstraction mechanism, type parametric combinators, which supports abstraction over type constructors defined by datatype declarations found in functional languages such as Miranda, Haskell, and ML. This mechanism allows the definition and use of high level abstractions not possible in traditional languages and could be used to define user programmable derived instance declarations for type classes in Haskel. We illustrate its use in an actual programming language by giving examples in the ML dialect CRML. 1 Introduction Abstraction is the key to effective programming. Abstracting over values leads to functions, abstracting over type parameters leads to parametric polymorphism. The thesis of this paper is that abstracting over type constructors leads to even more effective programming. The datatype declaration in ML introduces a new type constructor and a set of value constructors which have instances of this type constructor as their range. Type parametric programm...
DOI: 10.6083/6t053g34s
Author: Sheard, Tim
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2787361311