{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:39Z","timestamp":1761611259208,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662464"},{"type":"electronic","value":"9783540484837"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48483-3_12","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:13:32Z","timestamp":1269897212000},"page":"168-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-deterministic Computations in ELAN"],"prefix":"10.1007","author":[{"given":"H\u00e9l\u00e8ene","family":"Kirchner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Etienne","family":"Moreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"12_CR1","volume-title":"Technical report 5","author":"H. A\u00eft-Kaci","year":"1990","unstructured":"H. A\u00eft-Kaci. TheWAM: a (real) tutorial. Technical report 5, Digital Systems Research Center, Paris (France), January 1990."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"K. R. Apt and A. Schaerf. Search and imperative programming. In 24th POPL, pages 67\u201379, 1997.","DOI":"10.1145\/263699.263709"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, and H. Kirchner. Controlling rewriting by rewriting. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996.","DOI":"10.1016\/S1571-0661(04)00039-8"},{"key":"12_CR4","unstructured":"P. Borovansk\u00fd, C. Kirchner, and H. Kirchner. A functional view of rewriting and strategies for a semantics of ELAN. In M. Sato and Y. Toyama, editors, The Third Fuji International Symposium on Functional and Logic Programming, pages 143\u2013167, Kyoto, April 1998. World Scientific. Also report LORIA 98-R-165."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.3233\/FI-1998-34303","volume":"34","author":"C. Castro","year":"1998","unstructured":"C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34:263\u2013293, September 1998.","journal-title":"Fundamenta Informaticae"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In J. Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 4, Asilomar (California), September 1996. Electronic Notes in Theoretical Computer Science.","DOI":"10.1016\/S1571-0661(04)00034-9"},{"key":"12_CR7","unstructured":"H. Cirstea and C. Kirchner. Theorem proving Using Computational Systems: The case of the B Predicate Prover. Available at http:\/\/www.loria.fr\/ ffcirstea\/Papers\/TheoremProver.ps, 1997."},{"key":"12_CR8","unstructured":"Y. Caseau and F. Laburthe. Introduction to the CLAIRE programming language. Technical report 96-15, LIENS Technical, September 1996."},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-57840-4_34","volume-title":"Programming Languages and System Architectures PLSA\u201994","author":"K. Didrich","year":"1994","unstructured":"K. Didrich, A. Fett, C. Gerke, W. Grieskamp, and P. Pepper. OPAL: Design and implementation of an algebraic programming language. In J. Gutknecht, editor, Programming Languages and System Architectures PLSA\u201994, volume 782 of Lecture Notes in Computer Science, pages 228\u2013244. Springer-Verlag, March 1994."},{"key":"12_CR10","unstructured":"K. Futatsugi and A. Nakagawa. An overview of CAFE specification environment \u2014 an algebraic approach for creating, verifying, and maintaining formal specifications over networks. In Proceedings of the 1st IEEE Int. Conference on Formal Engineering Methods, 1997."},{"key":"12_CR11","volume-title":"Technical Report SRICSL-88-9","author":"J. A. Goguen","year":"1988","unstructured":"J. A. Goguen and T. Winkler. Introducing OBJ3. Technical Report SRICSL-88-9, SRI International, 333, Ravenswood Ave.,Menlo Park, CA 94025, August 1988."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"F. Henderson","year":"1996","unstructured":"F. Henderson, T. Conway, and Z. Somogyi. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29:17\u201354, October-December 1996.","journal-title":"Journal of Logic Programming"},{"key":"12_CR13","unstructured":"F. Henderson, Z. Somogyi, and T. Conway. Determinism analysis in the Mercury compiler. In Proceedings of the Nineteenth Australian Computer Science Conference, pages 337\u2013346, Melbourne, Australia, January 1996."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo set of equations. SIAM Journal of Computing, 15(4):1155\u20131194, 1986.Preliminary version in Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City (USA), 1984.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR15","unstructured":"C. Kirchner, H. Kirchner, and M. Vittek. Designing constraint logic programming languages using computational systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The Newport Papers., chapter 8, pages 131\u2013158. The MIT press, 1995."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1145\/151257.151260","volume":"2","author":"P. Klint","year":"1993","unstructured":"P. Klint. A meta-environment for generating programming environments. ACM Transactions on Software Engineering and Methodology, 2:176\u2013201, 1993.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"12_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/3-540-59200-8_79","volume-title":"Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany)","author":"H. Kirchner","year":"1995","unstructured":"H. Kirchner and P.-E. Moreau. Prototyping completion with constraints using computational systems. In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of Lecture Notes in Computer Science, pages 438\u2013443. Springer-Verlag, 1995."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.3233\/FI-1998-34302","volume":"34","author":"C. Kirchner","year":"1998","unstructured":"C. Kirchner and C. Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 34(3):225\u2013262, September 1998.","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"12_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96(1):73\u2013155, 1992.","journal-title":"Theoretical Computer Science"},{"key":"12_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/BFb0056617","volume-title":"Principles of Declarative Programming","author":"P.-E. Moreau","year":"1998","unstructured":"P.-E. Moreau and H. Kirchner. A compiler for rewrite programs in associative-commutative theories. In \u201cPrinciples of Declarative Programming\u201d, number 1490 in Lecture Notes in Computer Science, pages 230\u2013249. Springer-Verlag, September 1998. Report LORIA 98-R-226."},{"key":"12_CR21","unstructured":"P.-E. Moreau. A choice-point library for backtrack programming. JICSLP\u201998 Post-Conference Workshop on Implementation Technologies for Programming Languages based on Logic, 1998."},{"key":"12_CR22","unstructured":"P.-E. Moreau. Compiling nondeterministic computations. Technical Report 98-R-005, CRIN, 1998."},{"key":"12_CR23","unstructured":"V. Partington. Implementation of an Imperative Programming Language with Backtracking. Technical Report P9714, University of Amsterdam, Programming Research Group, 1997. Available by anonymous ftp from ftp.wins.uva.nl, le pub\/programming-research\/reports\/1997\/P9712.ps.Z."},{"key":"12_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-62950-5_81","volume-title":"Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain)","author":"C. Ringeissen","year":"1997","unstructured":"C. Ringeissen. Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain), volume 1232 of Lecture Notes in Computer Science, pages 323\u2013326. Springer-Verlag, 1997."},{"key":"12_CR25","unstructured":"H. Sawamura and T. Takeshima. Recursive unsolvability of determinacy, solvable cases of determinacy and their applications to Prolog optimization. In Proceedings of the Second International Logic Programming Conference, pages 200\u2013207, Boston, Massachusetts, 1985."},{"key":"12_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/3-540-61464-8_50","volume-title":"Proceedings of RTA\u201996","author":"M. Vittek","year":"1996","unstructured":"M. Vittek. A compiler for nondeterministic term rewriting systems. In H. Ganzinger, editor, Proceedings of RTA\u201996, volume 1103 of Lecture Notes in Computer Science, pages 154\u2013168, New Brunswick (New Jersey), July 1996. Springer-Verlag."},{"key":"12_CR27","unstructured":"D. H. D. Warren. An abstract Prolog instruction set. Technical Report 309, SRI International, Artificial Intelligence Center, 1983."}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Algebraic Development Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48483-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T09:55:51Z","timestamp":1685526951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48483-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662464","9783540484837"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-48483-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}