{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298391},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540194880"},{"type":"electronic","value":"9783540392910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19488-6_123","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:13:29Z","timestamp":1330200809000},"page":"287-301","source":"Crossref","is-referenced-by-count":39,"title":["Operational semantics of OBJ-3"],"prefix":"10.1007","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"R.M. Burstall, D.B. MacQueen, and D.T. Sannella. Hope: an experimental applicative language. In Conference Record of the 1980 LISP Conference, pages 136\u2013143, Stanford (Californie, USA), 1980.","DOI":"10.1145\/800087.802799"},{"key":"21_CR2","volume-title":"Proceedings of the EUROCAL conference","author":"A.J.J. Dick","year":"1985","unstructured":"A.J.J. Dick. Eril equational reasoning: an interactive laboratory. In B. Buchberger, editor, Proceedings of the EUROCAL conference, Springer-Verlag, Linz (Austria), 1985."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"K. Futatsugi, J.A. Goguen, J.P. Jouannaud, and J. Meseguer. Principles of OBJ2. In Proceedings of 12th ACM Symposium on Principles of Programming Languages Conference, 1985.","DOI":"10.1145\/318593.318610"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"H. Ganzinger. Completion Procedure for Conditional Equations. Technical Report 234, Dortmund University, 1987.","DOI":"10.1007\/3-540-19242-5_6"},{"key":"21_CR5","unstructured":"M-C. Gaudel. A First Introduction to PLUSS. Meteor Report, LRI, 1984."},{"key":"21_CR6","first-page":"165","volume-title":"Proceedings of the 13th Colloquium on Trees in Algebra and Programming","author":"I. Gnaedig","year":"1988","unstructured":"I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. In M. Dauchet and M. Nivat, editors, Proceedings of the 13th Colloquium on Trees in Algebra and Programming, pages 165\u2013184, Springer-Verlag, Nancy (France), 1988."},{"key":"21_CR7","volume-title":"Proceedings of the first international workshop on conditional term rewriting systems","author":"J. Goguen","year":"1988","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 of the first international workshop on conditional term rewriting systems, Springer-Verlag, Orsay (France), June 1988. Also as internal report CRIN: 88-R-001."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"J. Goguen, C. Kirchner, and J. Meseguer. Concurrent term rewriting as a model of computation. In Proceedings of the workshop on graph reduction, September 1986.","DOI":"10.1007\/3-540-18420-1_50"},{"key":"21_CR9","unstructured":"J. Goguen, C. Kirchner, J. Meseguer, and T. Winkler. OBJ as a language for concurrent programming. In Proceedings of the second international conference on supercomputing, May 1987."},{"key":"21_CR10","unstructured":"J. Goguen and J. Meseguer. Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance. Technical Report To appear, SRI International, Computer Science Lab, 1988. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, J.P. Jouannaud, and J. Meseguer. Operational semantics for order-sorted algebra. In Proceeding of the 12th ICALP, Nafplion (Greece), pages 221\u2013231, 1985.","DOI":"10.1007\/BFb0015747"},{"key":"21_CR12","unstructured":"J.A. Goguen, C. Kirchner, S. Leinwand, J. Meseguer, and T. Winkler. Progress report on the rewrite rule machine. IEEE Computer Architecture Technical Commitee Newsletter, 7\u201321, march 1986."},{"key":"21_CR13","unstructured":"J.A. Goguen and J. Meseguer. Order-sorted algebra solves the constructor-selector, multiple representation and coercion problem. In Proceeding of the second symposium on Logic In Computer Science, 1987."},{"key":"21_CR14","unstructured":"J.A. Goguen and J. Meseguer. Remarks on remarks on many-sorted equational logic. Bulletin of EATCS, (30):66\u201373, October 1986."},{"key":"21_CR15","unstructured":"J.A. Goguen, J. Meseguer, and D. Plaisted. Programming with parameterized abstract objects in OBJ. Theory And Practice of Software Technology, 163\u2013193, 1982."},{"key":"21_CR16","unstructured":"J.A. Goguen and U. Montanari. An Abstract Machine for Fast Pattern Matching of Linear Pattern. Technical Report, SRI International, 1987."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"C.M. Hoffmann and M.J. O'Donnell. Programming with equations. Transactions on Programming Languages and Systems, 4(1), 1982.","DOI":"10.1145\/357153.357158"},{"key":"21_CR18","unstructured":"G. Huet and JJ. Levy. Computations in Non-ambiguous Linear Term Rewriting Systems. Technical Report, INRIA Laboria, 1979."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"J.P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4), 1986. Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, 1984.","DOI":"10.1137\/0215084"},{"key":"21_CR21","volume-title":"Proceedings Second Conference on Rewriting Techniques and Applications","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan. A compiler for term rewriting system. In Proceedings Second Conference on Rewriting Techniques and Applications, Springer Verlag, Bordeaux (France), May 1987."},{"key":"21_CR22","unstructured":"C. Kirchner. M\u00e9thodes et outils de conception syst\u00e9matique d'algorithmes d'unification dans les th\u00e9ories \u00e9quationnelles. Th\u00e8se d'\u00e9tat de l'Universit\u00e9 de Nancy I, 1985."},{"key":"21_CR23","unstructured":"C. Kirchner. Order-sorted equational unification. 1988."},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"C. Kirchner, H. Kirchner, and J. Meseguer. Operational semantics of OBJ3. Technical Report 87-R-87, Centre de Recherche en Informatique de Nancy, 1987.","DOI":"10.1007\/3-540-19488-6_123"},{"key":"21_CR25","unstructured":"H. Kirchner. Preuves par compl\u00e9tion dans les vari\u00e9t\u00e9s d'alg\u00e8bres. Th\u00e8se d'\u00e9tat de l'Universit\u00e9 de Nancy I, 1985."},{"key":"21_CR26","unstructured":"A. Megrelis. (S, <, \u03a3)-algebras and-homomorphisms. Personal communication, March 1986."},{"key":"21_CR27","unstructured":"J. Meseguer. An algorithm to compile righthand sides. Personal communication, March 1987."},{"key":"21_CR28","unstructured":"J. Meseguer and J.A. Goguen. Initiality, induction and computability. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, Cambridge University Press, 1985."},{"key":"21_CR29","unstructured":"J. Meseguer, J.A. Goguen, and G. Smolka. Order sorted unification. In Proceedings of the Colloquium on Resolution of Equations in Algebraic Structures, May 1987."},{"key":"21_CR30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery, 28:233\u2013264, 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR31","volume-title":"Proceedings 8th Conference on Automated Deduction, Oxford","author":"M. Schmidt-Schauss","year":"1986","unstructured":"M. Schmidt-Schauss. Unification in many sorted equational theories. In J. Siekmann, editor, Proceedings 8th Conference on Automated Deduction, Oxford, Springer Verlag, Oxford (England), 1986."},{"key":"21_CR32","unstructured":"G. Smolka, W. Nutt, J.A. Goguen, and J. Meseguer. Order sorted equational computation. In Proceedings of the Colloquium on Resolution of Equations in Algebraic Structures, May 1987."},{"key":"21_CR33","unstructured":"G.L. Steele. Common Lisp: The Language. Digital Press, 1984."},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Y. Toyama. Counterexamples to terminating for the direct sum of term rewriting systems. In Information Processing Letters, pages 141\u2013143, May 1986.","DOI":"10.1016\/0020-0190(87)90122-0"},{"issue":"1","key":"21_CR35","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/7531.7534","volume":"34","author":"Y. Toyama","year":"1986","unstructured":"Y. Toyama. On the church-rosser property for the direct sum of term rewriting systems. Journal of the Association for Computing Machinery, 34(1):128\u2013143, January 1986.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR36","first-page":"1","volume-title":"Proc. 2nd Conf. on Functional Programming Languages and Computer Architecture","author":"D.A. Turner","year":"1985","unstructured":"D.A. Turner, Miranda: a non-strict functional language with polymorphic types. In Proc. 2nd Conf. on Functional Programming Languages and Computer Architecture, pages 1\u201316, Springer Verlag, Nancy (France), 1985."},{"key":"21_CR37","unstructured":"C. Walther. Unification in many sorted theories. In T. O'Shea, editor, Proceedings of the European Conference on Artificial Intelligence, Pisa, Italy, pages 593\u2013602, ECAI, 1984."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19488-6_123.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:26Z","timestamp":1605644246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19488-6_123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194880","9783540392910"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-19488-6_123","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}