A Compiler for Nondeterministic Term Rewriting Systems
暂无分享,去创建一个
[1] Lennart Augustsson,et al. Compiling Pattern Matching , 1985, FPCA.
[2] Emmanuel Kounalis,et al. Compilation of Pattern Matching with Associative-Commutative Functions , 1991, TAPSOFT, Vol.1.
[3] Claude Kirchner,et al. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[4] Thom W. Frühwirth,et al. Constraint Handling Rules , 2009, Constraint Programming.
[5] Andrew W. Appel,et al. A Standard ML compiler , 1987, FPCA.
[6] Stéphane Kaplan,et al. A Compiler for Conditional Term Rewriting Systems , 1987, RTA.
[7] Wolfgang Grieskamp,et al. OPAL: Design and Implementation of an Algebraic Programming Language , 1994, Programming Languages and System Architectures.
[8] Christoph M. Hoffmann,et al. Pattern Matching in Trees , 1982, JACM.
[9] Marian Vittek. Elan : un cadre logique pour le prototypage de langages de programmation avec contraintes , 1994 .