Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. André Arnold, P. Naudin, and Maurice Nivat. On semantics of nondeterministic recursive program schemes. In Algebraic Methods in Semantics, pages 1–33. Cambridge University Press, 1985.
2. Christoph Beierle and Angelika Voss. Implementation specifications. In Hans-Jörg Kreowski, editor, Recent Trends in Data Type Specification, volume Informatik-Fachberichte 116, pages 39–52. Springer-Verlag, 1985. Selected papers from the Third Workshop on Theory and Applications of Abstract Data Types.
3. Jan Bergstra and John Tucker. Characterization of computable data types by means of a finite equational specification method. In Automata, Languages and Programming, Seventh Colloquium, pages 76–90. Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 81.
4. Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433–454, 1935.
5. Rod Burstall and Joseph Goguen. Putting theories together to make specifications. In Raj Reddy, editor, Proceedings, Fifth International Joint Conference on Artificial Intelligence, pages 1045–1058. Department of Computer Science, Carnegie-Mellon University, 1977.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献