Paper Info
Title
The algebraic specification of Semicomputable data types
Abstract
A proof is given for a theorem stating that every semicomputable data type can be specified with only one hidden sort. Preceding this, definitions for the notions signature and algebra are given in the setting of category theory and the notion of a (semi-)computable algebra is discussed.
Year
DOI
Venue
1987
10.1007/3-540-50325-0_13
Lecture notes in Computer Science on Recent trends in data type specification
Keywords
DocType
ISBN
Semicomputable data type,algebraic specification
Conference
0-387-50325-0
Citations 
PageRank 
References 
1
0.63
2
Authors
1
Name
Order
Citations
PageRank
Jos Vrancken19013.98