DocumentCode
2179621
Title
Data types as initial algebras: A unification of Scottery and ADJery
Author
Kanda, Akira
fYear
1978
fDate
16-18 Oct. 1978
Firstpage
221
Lastpage
230
Abstract
This paper presents a formulation within the framework of data types as initial algebras, of parameterizations of data types. We will observe that Scott´s data type constructors like +, ×, and circular definitions are parameterizations in our sense. Thence we will provide a uniform ground to compare ADJ-like data types with Lehmann-Smyth´s data types, and will justify recent ADJ´s claim that polynomial data types of Lehmann-Smyth could be simulated within ADJery.
Keywords
Algebra; Computer science; Lattices; Mathematical model; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1978., 19th Annual Symposium on
Conference_Location
Ann Arbor, MI, USA
ISSN
0272-5428
Type
conf
DOI
10.1109/SFCS.1978.12
Filename
4567982
Link To Document