Publisher
Springer Berlin Heidelberg
Reference54 articles.
1. S. Abramsky, C.-H. Luke Ong, Full Abstraction in the Lazy λ-Calculus, Information and Computation 105 (1993) 159–267
2. K.R. Apt, Logic Programming, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Elsevier (1990) 493–574
3. J.C.M. Baeten, W.P. Weijland, Process Algebra Cambridge University Press 1990
4. M. Barr, Terminal Coalgebras in Well-founded Set Theory, Theoretical Computer Science 114 (1993) 299–315
5. J.A. Bergstra, J.V. Tucker, Top-down Design and the Algebra of Communicating Processes, Science of Computer Programming 5 (1985) 171–199
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From OBJ to Maude and Beyond;Algebra, Meaning, and Computation;2006
2. Behavioral abstraction is hiding information;Theoretical Computer Science;2004-10
3. Extensional Theories and Rewriting;Automata, Languages and Programming;2004
4. Towards Behavioral Maude;Electronic Notes in Theoretical Computer Science;2002-10
5. On the Integration of Observability and Reachability Concepts;Lecture Notes in Computer Science;2002