Author:
Fiore M.P.,Moggi E.,Sangiorgi D.
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference35 articles.
1. A domain equation for bisimulation;Abramsky;Inform. and Comput.,1991
2. Abramsky, S., Jagadeesan, R., and Malacaria, P.1994, Full abstraction for PCF (extended abstract), inProceedings, Theoretical Aspects of Computer Software. International Symposium TACS'94M. Hagiya and J. C. Mitchell, Eds., Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin/New York.
3. Abramsky, S, and, Jung, A. 1994, Domain theory, in, Handbook of Logic in Computer Science, Oxford Univ. Press, London.
4. CPO models for compact GSOS languages;Aceto;Inform. and Comput.,1996
5. A representable approach to finite nondeterminism;Anderson;Theoret. Comput. Sci.,1997
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献