{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:24Z","timestamp":1725663864358},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554257"},{"type":"electronic","value":"9783540470663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55425-4_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:59:05Z","timestamp":1330250345000},"page":"121-138","source":"Crossref","is-referenced-by-count":9,"title":["Implementing parallel rewriting"],"prefix":"10.1007","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"Patrick","family":"Viry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"5_CR1","unstructured":"G. Boudol. Computational semantics of term rewriting systems. In M. Nivat and J. Reynolds, editors, Application of Algebra to Language definition and Compilation. Prentice Hall, 1985. Also INRIA research report 192 (1983)."},{"issue":"2\/3","key":"5_CR2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0019-9958(85)80003-6","volume":"65","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz. Computing with rewrite systems. Information and Control, 65(2\/3):122\u2013157, 1985.","journal-title":"Information and Control"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leuven, editor, Handbook of Theoretical Computer Science, chapter 6, pages 244\u2013320. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Gregory Burns et al. Trillium operating system. In Proc. Third Conference on Hypercube Concurrent Computers and Applications, pages 374\u2013376. ACM, 1988.","DOI":"10.1145\/62297.62338"},{"key":"5_CR5","unstructured":"L. Fribourg. SLOG: A logic programming language intepreter based on clausal superposition and rewriting. In Proceedings of the IEEE Symposium on Logic Programming, pages 172\u2013184, Boston, MA, July 1985."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ-3. In J.-P. Jouannaud and S. Kaplan, editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of Lecture Notes in Computer Science, pages 258\u2013263. Springer-Verlag, 1988. Also as internal report CRIN: 88-R-001.","DOI":"10.1007\/3-540-19242-5_22"},{"key":"5_CR7","unstructured":"J. Goguen, C. Kirchner, S. Leinwand, J. Meseguer, and T. Winkler. Progress report on the rewrite rule machine. IEEE Computer Architecture Technical Commitee Newsletter, pages 7\u201321, March 1986."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In R. Keller and J. Fasel, editors, Proceedings of Graph Reduction Workshop, volume 279 of Lecture Notes in Computer Science, pages 53\u201393. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18420-1_50"},{"key":"5_CR9","unstructured":"J. A. Goguen and J. Tardo. OBJ-0 preliminary users manual. Semantics and theory of computation report no. 10, UCLA, 1977."},{"key":"5_CR10","unstructured":"J.A. Goguen. The rewrite rule machine project. In Proceedings of the second international conference on supercomputing, Santa Clara, California, May 1987."},{"key":"5_CR11","unstructured":"J.A. Goguen, C. Kirchner, and J. Meseguer. Models of computation for the rewrite rule machine. Technical report, Rapport CRIN 86-R-104, 1986."},{"key":"5_CR12","unstructured":"J.A. Goguen and J. Meseguer. EQLOG: Equality, types and generic modules for logic programming. In D. DeGroot and G. Lindstrom, editors, Logic Programming. Funstions, relations and equations. Prentice Hall, 1986."},{"key":"5_CR13","volume-title":"Asf system user's guide. internal report CS-R8823","author":"P. R. H. H. Hendriks","year":"1988","unstructured":"P.R.H. Hendriks. Asf system user's guide. internal report CS-R8823, Centre for Mathematics and Computer Science, PO BOX 4079, 1009 AB Amsterdam, Netherlands, May 1988."},{"key":"5_CR14","unstructured":"M. Hermann, C. Kirchner, and H. Kirchner. Implementations of term rewriting systems. Technical Report 89-R-218, Centre de Recherche en Informatique de Nancy, 1989. To appear in the Computer Journal, British Computer Society."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"T. Heuillard. Compiling conditional rewriting systems. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of Lecture Notes in Computer Science, pages 111\u2013128. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-19242-5_10"},{"issue":"1","key":"5_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. Hoffmann","year":"1982","unstructured":"C. Hoffmann and M.J. O'Donnell. Pattern matching in trees. Journal of the Association for Computing Machinery, 29(1):68\u201395, 1982.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR17","unstructured":"G. Huet and J.-J. Levy. Call by need computations in non-ambiguous linear term rewriting systems. Research report 359, INRIA, August 1979."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules: A survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405. Academic Press, New York, 1980."},{"issue":"1","key":"5_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0743-1066(89)90030-7","volume":"6","author":"N. A. Josephson","year":"1989","unstructured":"N. Alan Josephson and Nachum Dershowitz. An implementation of narrowing. J. of Logic Programming, 6(1 & 2):57\u201377, March 1989.","journal-title":"J. of Logic Programming"},{"key":"5_CR20","unstructured":"J.-P. Jouannaud and G. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. Research report, CRIN, 1990. To appear in Festschrift for Robinson, J.-L. Lassez and G. Plotkin, editors, MIT Press."},{"key":"5_CR21","first-page":"25","volume-title":"volume 256 of Lecture Notes in Computer Science","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan. A compiler for conditional term rewriting system. In P. Lescanne, editor, Proceedings 2nd Conference on Rewriting Techniques and Applications, Bordeaux (France), volume 256 of Lecture Notes in Computer Science, pages 25\u201341, Bordeaux (France), May 1987. Springer-Verlag."},{"key":"5_CR22","first-page":"1","volume-title":"volume 456 of Lecture Notes in Computer Science","author":"C. Kirchner","year":"1990","unstructured":"C. Kirchner and P. Viry. Implementing parallel rewriting. In P. Deransart and J. Maluszynski, editors, Proceedings of PLILP'90, volume 456 of Lecture Notes in Computer Science, pages 1\u201315, Link\u00f6ping (Sweden), August 1990. Springer-Verlag."},{"key":"5_CR23","first-page":"569","volume-title":"volume 35 of Lecture Notes in Computer Science","author":"N. Lindenstrauss","year":"1989","unstructured":"N. Lindenstrauss. A parallel implementation of rewriting and narrowing. In Proceedings 3rd Conference on Rewriting Techniques and Applications, Chapel Hill, (North Carolina, USA), volume 35 of Lecture Notes in Computer Science, pages 569\u2013573, Chapel Hill, NC, April 1989. Springer-Verlag"},{"key":"5_CR24","unstructured":"M. Loi and B. Tourancheau. Trollius 2.0. Technical report, Ecole Normale Sup\u00e9rieure de Lyon, 1990. In french."},{"key":"5_CR25","unstructured":"Jos\u00e9 Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"M. J. O'Donnell. Computing in Systems Described by Equations, volume 58 of Lecture Notes in Computer Science. Springer-Verlag, 1977.","DOI":"10.1007\/3-540-08531-9"},{"key":"5_CR27","unstructured":"P. Viry. Implantation parall\u00e8le de la surr\u00e9duction et de la r\u00e9\u00e9criture. Rapport de DEA de l'universit\u00e9 de Nancy I, September 1989."},{"key":"5_CR28","unstructured":"P. Viry. Properties of concurrent rewriting. Technical report, Centre de Recherche en Informatique de Nancy, 1991. In preparation."}],"container-title":["Lecture Notes in Computer Science","Parallelization in Inference Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55425-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:18:35Z","timestamp":1640924315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55425-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554257","9783540470663"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-55425-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}