{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:07Z","timestamp":1725663067354},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:35:20Z","timestamp":1330180520000},"page":"53-93","source":"Crossref","is-referenced-by-count":28,"title":["Concurrent term rewriting as a model of computation"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Goguen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","unstructured":"Lennart Augustsson. Compiling Pattern-Matching. Technical Report 25, University of G\u00f6teborg, Programming Methodology Group, September 1986."},{"issue":"8","key":"4_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"John Backus. Can programming be liberated from the von neumann style? Communications of the Association for Computing Machinery, 21(8):613\u2013641, 1978.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"4_CR3","unstructured":"M. Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Technical Report, Universit\u00e9 de Bordeaux 1, 1985."},{"key":"4_CR4","unstructured":"G\u00e9rard Boudol. Computational semantics of term rewriting systems. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 169\u2013236, Cambridge University Press, 1985."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork, Paris Kanellakis, and Larry Stockmeyer. Parallel Algorithms for Term Matching. Technical Report, MIT, 1986.","DOI":"10.1007\/3-540-16780-3_109"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud, and Jos\u00e9 Meseguer. Principles of OBJ2. In Brian K. Reid, editor, Proceedings of 12th ACM Symposium on Principles of Programming Languages, pages 52\u201366, Association for Computing Machinery, 1985.","DOI":"10.1145\/318593.318610"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. How to prove algebraic inductive hypotheses without induction: with applications to the correctness of data type representations. In W. Bibel and Robert Kowalski, editors, Proceedings, Fifth Conference on Automated Deduction, pages 356\u2013373, Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 87.","DOI":"10.1007\/3-540-10009-1_27"},{"issue":"5","key":"4_CR8","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TSE.1984.5010277","volume":"SE-10","author":"J. Goguen","year":"1984","unstructured":"Joseph Goguen. Parameterized programming. Transactions on Software Engineering, SE-10(5):528\u2013543, September 1984.","journal-title":"Transactions on Software Engineering"},{"key":"4_CR9","unstructured":"Joseph Goguen, Jean-Pierre Jouannaud, and Jos\u00e9 Meseguer. Operational semantics of ordersorted algebra. In W. Brauer, editor, Proceedings, 1985 International Conference on Automata, Languages and Programming, Springer-Verlag, 1985. Lecture Notes in Computer Science, Volume 194."},{"key":"4_CR10","unstructured":"Joseph Goguen, Claude Kirchner, Sany Leinwand, Jos\u00e9 Meseguer, and Timothy Winkler. Progress report on the rewrite rule machine. IEEE Computer Architecture Technical Committee Newsletter, 7\u201321, March 1986."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Eqlog: equality, types, and generic modules for logic programming. In Douglas DeGroot and Gary Lindstrom, editors, Functional and Logic Programming, pages 295\u2013363, Prentice-Hall, 1986. An earlier version appears in Journal of Logic Programming, Volume 1, Number 2, pages 179\u2013210, September 1984.","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Extensions and foundations for object-oriented programming. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, MIT Press, to appear 1987. Preliminary version in SIGPLAN Notices, Volume 21, Number 10, pages 153\u2013162, October 1986.","DOI":"10.1145\/323648.323755"},{"key":"4_CR13","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance. Technical Report To appear, SRI International, Computer Science Lab, 1987. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983."},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/357153.357158","volume":"1","author":"C. M. Hoffman","year":"1982","unstructured":"Christoph M. Hoffman and Michael O'Donnell. Programming with equations. Transactions on Programming Languages and Systems, 1(4):83\u2013112, 1982.","journal-title":"Transactions on Programming Languages and Systems"},{"key":"4_CR15","unstructured":"G\u00e9rard Huet and Jean-Jacques Levy. Computations in Non-ambiguous Linear Term Rewriting Systems. Technical Report, INRIA Laboria, 1979."},{"key":"4_CR16","unstructured":"G\u00e9rard Huet and Derek Oppen. Equations and rewrite rules: a survey. In Ron Book, editor, Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"John Hughes. Lazy Memo-Functions. Technical Report 21, University of G\u00f6teborg, Programming Methodology Group, September 1985.","DOI":"10.1007\/3-540-15975-4_34"},{"key":"4_CR18","unstructured":"Bharadwaj Jayaraman and Robert Keller. Resource control in a demand-driven data-flow model. IEEE Conference on Parallel Processing, 118\u2013127, August 1980."},{"key":"4_CR19","unstructured":"Robert Keller, F. C. H. Lin, and J. Tanaka. Rediflow multiprocessing. IEEE Compcon, 410\u2013417, February 1984."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Robert Keller, Gary Lindstrom, and S. Patil. A loosely-coupled applicative multi-processing system. AFIPS Conference Proceedings, 613\u2013622, June 1979.","DOI":"10.1109\/MARK.1979.8817294"},{"key":"4_CR21","unstructured":"Sany Leinwand and Joseph Goguen. Architectural options for the rewrite rule machine. In Steven and Svetlana Kartashev, editors, Proceedings, Second International Supercomputing Conference, Van Nostrand, 1987. To appear."},{"key":"4_CR22","unstructured":"Jos\u00e9 Meseguer and Joseph Goguen. Deduction with Many-Sorted Rewrite Rules. Technical Report CSLI-85-42, Center for the Study of Language and Information, Stanford University, December 1985. To appear in Theoretical Computer Science."},{"key":"4_CR23","unstructured":"Jos\u00e9 Meseguer and Joseph Goguen. Initiality, induction and computability. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 459\u2013541, Cambridge University Press, 1985."},{"key":"4_CR24","unstructured":"Timothy Winkler, Sany Leinwand, and Joseph Goguen. Simulation of concurrent term rewriting. In Steven and Svetlana Kartashev, editors, Proceedings, Second International Supercomputing Conference, Van Nostrand, 1987. To appear."}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:15:10Z","timestamp":1619543710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}