Author:
Diaconescu Răzvan,Futatsugi Kokichi
Subject
General Computer Science,Theoretical Computer Science
Reference40 articles.
1. R. Burstall, J. Goguen, The semantics of Clear, a specification language, in: D. Bjorner (Ed.), Proceedings, 1979 Copenhagen Winter School on Abstract Software Specification, Springer, Berlin, 1980, pp. 292–332 (Lecture Notes in Computer Science, Vol. 86; based on unpublished notes handed out at the Symposium on Algebra and Applications, Stefan Banach Center, Warsaw, Poland, 1978.)
2. Incompleteness of behavioural logics;Buss,2000
3. M. Clavel, S. Eker, P. Lincoln, J. Meseguer, Principles of Maude, Electronic Notes in Theoretical Computer Science, Vol. 4, Elseiver Science, Amsterdam, 1996. (Proc., 1st Internat. Workshop on Rewriting Logic and its Applications, Asilomar, CA, September 1996.)
4. Weak inclusion systems;Căzănescu;Math. Struct. Comput. Sci.,1997
5. R. Diaconescu, Category-based semantics for equational and constraint logic programming, DPhil. Thesis, University of Oxford, 1994.
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献