Controlling rewriting by rewriting
暂无分享,去创建一个
[1] Marian Vittek,et al. A Compiler for Nondeterministic Term Rewriting Systems , 1996, RTA.
[2] MeseguerJosé. Conditional rewriting logic as a unified model of concurrency , 1992 .
[3] Pascal Van Hentenryck,et al. Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.
[4] Johan Jeuring,et al. Merging Monads and Folds for Functional Programming , 1995, Advanced Functional Programming.
[5] José Meseguer,et al. Axiomatizing Reflective Logics and Languages , 1996 .
[6] Claude Kirchner,et al. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[7] M. Clavel,et al. Principles of Maude , 1996, WRLA.
[8] José Meseguer,et al. Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..
[9] Narciso Martí-Oliet,et al. Rewriting Logic as a Logical and Semantic Framework , 1996 .
[10] Marian Vittek. Elan : un cadre logique pour le prototypage de langages de programmation avec contraintes , 1994 .
[11] J. Goguen,et al. 2OBJ: a metalogical framework theroem prover based on equational logic , 1992, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.