Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. S. Abramsky, C.-H. Luke Ong. Full Abstraction in the Lazy Lambda Calculus. Information and Computation 105(2), 159–267, 1993.
2. Benson, D.B., Ben-Schachar, O. Bisimulation of automata. Information and Computation, 79, 60–83, 1988.
3. Bidoit, M., Hennicker, R., Wirsing, M. Behavioural and abstractor specifications. Science of Computer Programming 25(2–3):149–186, 1995.
4. Bidoit, M., Tarlecki, A. Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, Ecole Norm. Sup., 1995.
5. Bidoit, M., Tarlecki A. Behavioural satisfaction and equivalence in concrete model categories. Proc. 20th CAAP'96, Linköping, Springer-Verlag.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献