Algebras with approximation and recursive data structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 278)
KeywordsStructure Object Basic Algebra Approximative Relation Canonical System Object Domain
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.Lehman D.J., Smith M.B. Data types (Extended abstract). — IEEE Symp. on Foundations of Computer Science, 1977, p. 7–12.Google Scholar
- 2.Kanda A. Data types as initial algebras: a unification of Scottery and ADJery. — IEEE Symp. on Foundations of Comp.Sci., 1978, p.221–230.Google Scholar
- 3.Gorokhovsky S.S., Kapitonova Ju.V., Letichevsky A.A. On means for programming and solving logical problems in software systems (Besic notions of language L2). — Cybernetics, No.4, 1973 (in Russian).Google Scholar
- 4.Bublik V.V., Gorokhovsky S.S. Algebraic treatment of data structures. — Cybernetics, No.2, 1978, p.10–15 (in Russian).Google Scholar
© Springer-Verlag Berlin Heidelberg 1987