{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:39Z","timestamp":1725663339527},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50667-5_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:30:25Z","timestamp":1330183825000},"page":"245-254","source":"Crossref","is-referenced-by-count":2,"title":["Solving equations in an equational language"],"prefix":"10.1007","author":[{"given":"Jia-Huai","family":"You","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"25_CR1","unstructured":"Cartwright, R. and J. McCarthy, \u201cRecursive programs as functions in a first order theory,\u201d in Mathematical Studies of Information Processing, E.K. Blum et al. (eds.) LNCS 75."},{"key":"25_CR2","unstructured":"Dershowitz, H. and D. Plaisted, \u201cLogic programming cum applicative programming,\u201d in Proc. 1985 Symposium on Logic Programming, Boston, Mass., July, 1985."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Dincbas, M. and P. van Hentenryck, \u201cExtended unification algorithms for the integration of functional programming into logic programming,\u201d Journal of Logic Programming, 1987.","DOI":"10.1016\/0743-1066(87)90002-1"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0743-1066(87)90006-9","volume":"4","author":"M.H. Emden van","year":"1986","unstructured":"van Emden, M.H. and K. Yukawa, \u201cLogic programming with equality,\u201d J. of Logic Programming, 4:265\u2013288, 1986.","journal-title":"J. of Logic Programming"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-12727-5_12","volume":"159","author":"F Fages","year":"1983","unstructured":"Fages, F and G. Huet, \u201cUnification and matching in equational theories,\u201d in Proc. CAAP '83, LNCS 159, pp. 205\u2013220, 1983.","journal-title":"Proc. CAAP '83, LNCS"},{"key":"25_CR6","unstructured":"Fribourg, L., \u201cSLOG: A logic programming language interpreter based on clausal superposition and rewriting,\u201d in Proc. 1985 Symposium on Logic Programming, Boston, Mass."},{"key":"25_CR7","unstructured":"Gallier J.H. and S. Raatz, \u201cSLD-Resolution methods for Hom clauses with equality based on E-unification E-unification procedure,\u201d in Proc. of 1986 Symposium on Logic Programming, SLC, Utah, pp. 168\u2013179, 1986."},{"key":"25_CR8","first-page":"216","volume":"256","author":"J.H. Gallier","year":"1987","unstructured":"Gallier J.H. and W. Snyder, \u201cA general complete E-unification procedure,\u201d in Proc. of RTA '87, LNCS 256, pp. 216\u2013227, 1987.","journal-title":"Proc. of RTA '87, LNCS"},{"key":"25_CR9","unstructured":"Goguen, J.A. and J.J. Tardo, \u201cAn introduction to OBJ: a language for writing and testing formal algebraic program specifications,\u201d in Specification of Reliable Software, IEEE, pp 170\u2013189, 1979."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"2","author":"J.A. Goguen","year":"1984","unstructured":"Goguen, J.A. and J. Meseguer, \u201cEquality, types, modules and generics for logic programming,\u201d Journal of Logic Programming, Vol 2. 1984, pp 179\u2013210.","journal-title":"Journal of Logic Programming"},{"key":"25_CR11","series-title":"Technical Report","volume-title":"Call by need computations in nonambiguous linear term rewriting systems","author":"G. Huet","year":"1979","unstructured":"Huet, G. and J-J. L\u00e9vy, \u201cCall by need computations in nonambiguous linear term rewriting systems,\u201d Technical Report, 359, INRIA, Le Chesnay, France, 1979."},{"key":"25_CR12","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":"Huet, G. and D.C. Oppen, \u201cEquations and rewrite rules: a survey,\u201d in Formal Language Theory: Perspectives and Open Problems, R.V. Book (ed.), pp. 349\u2013405, Academic Press, New York, 1980."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Hullot, J.M., \u201cCanonical forms and unification,\u201d in Proc. 5th Conference on Automated Deduction, pp. 318\u2013334, 1980.","DOI":"10.21236\/ADA087640"},{"key":"25_CR14","unstructured":"Jaffar, J., J-L. Lassez and M. Maher, \u201cA logic programming scheme,\u201d in Logic Programming: Functions, Relations, and Equations, D. DeGroot and G. Lindstrom (eds.), Prentice-Hall, 1986."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Jaffar, J., J-L. Lassez and M. Maher, \u201cConstraint logic programming,\u201d in Proc. 14th POPL, pp. 111\u2013119, Munich, West Germany, 1987.","DOI":"10.1145\/41625.41635"},{"key":"25_CR16","unstructured":"Levi, G., C. Palamidessi, P. Bosco, E. Giovannetti and C. Moiso, \u201cA complete semantic characterization of K-LEAF\u201d, in Proc. 1987 Symposium on Logic Programming, pp. 318\u2013327. San Francisco, California, September 1987."},{"key":"25_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W., Foundations of Logic Programming, Springer-Verlag, New York, 1984."},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., and U. Montanari, \u201cAn efficient unification algorithm,\u201d ACM Transaction on Programming Languages and Systems, Vol. 4, No. 2, pp. 258\u2013282, 1982.","journal-title":"ACM Transaction on Programming Languages and Systems"},{"key":"25_CR19","unstructured":"Martelli, A., C. Moiso and G.F. Rossi \u201cAn algorithm for unification in equational theories\u201d, in Proc. 1986 International Symposium on Logic Programming, pp. 180\u2013186, Salt Lake City, Utah, 1986."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Mishra, P. and U. Reddy, \u201cDeclaration-free type checking\u201d in Proc. of 12th POPL, pp. 7\u201321, 1985.","DOI":"10.1145\/318593.318603"},{"key":"25_CR21","volume-title":"Lecture notes in computer science, vol. 58","author":"M. O'Donnell","year":"1977","unstructured":"O'Donnell, M., \u201cComputing in systems described by equations,\u201d Lecture notes in computer science, vol. 58, Springer-Verlag, New York, 1977."},{"key":"25_CR22","volume-title":"Equational Logic as a Programming Language","author":"M. O'Donnell","year":"1985","unstructured":"O'Donnell, M., \u201cEquational Logic as a Programming Language,\u201d The MIT Press, Cambridge, Massachusetts, 1985."},{"key":"25_CR23","first-page":"73","volume":"7","author":"G. Plotkin","year":"1972","unstructured":"Plotkin, G., \u201cBuilding-in equational theories,\u201d in Machine Intelligence 7, pp. 73\u201390, Edinburgh University Press, 1972.","journal-title":"Machine Intelligence"},{"key":"25_CR24","unstructured":"Reddy, U., \u201cNarrowing as the operational semantics of functional languages,\u201d in Proc. 1985 Symposium on Logic Programming, pp. 138\u2013151, Boston, Mass., July, 1985."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-15976-2_7","volume":"202","author":"P R\u00e9ty","year":"1985","unstructured":"R\u00e9ty P, C. Kirchner, H. Kirchner and P. Lescanne, \u201cNARROWER: a new algorithm and its application to logic programming,\u201d in Proc. Rewriting Techniques and Applications, also in Lecture Notes in Computer Science 202, pp. 141\u2013157, 1985.","journal-title":"Proc. Rewriting Techniques and Applications, also in Lecture Notes in Computer Science"},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-17220-3_20","volume":"256","author":"P. R\u00e9ty","year":"1987","unstructured":"R\u00e9ty P., \u201cImproving basic narrowing techniques,\u201d in Proc. Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pp. 228\u2013241, 1987.","journal-title":"Proc. Rewriting Techniques and Applications, Lecture Notes in Computer Science"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Siekmann, J., \u201cUniversal unification,\u201d in Proc. 7th International Conference on Automated Deduction, pp. 1\u201342, Napa, California, May, 1984.","DOI":"10.1007\/978-0-387-34768-4_1"},{"key":"25_CR28","unstructured":"Stickel, M., \u201cAutomated deduction by theory resolution,\u201d J. of Automated Reasoning, Vol. 2 1986. Short version in Proc. IJCAI-85, pp. 1181\u20131186, Aug. 18\u201323, Los Angeles, CA, 1985."},{"key":"25_CR29","unstructured":"You, J-H. \u201cLogic programming for artificial intelligence: an approach based on building-in theories,\u201d Dept. of Computing Science, Univ. of Alberta, (a proposal), 1986."},{"key":"25_CR30","first-page":"209","volume-title":"Proc. ACM 13th POPL","author":"J-H. You","year":"1986","unstructured":"You, J-H. and P.A. Subrahmanyam, \u201cEquational logic programming: an extension to equational programming,\u201d in Proc. ACM 13th POPL, pp. 209\u2013218, St. Petersburg, Florida, January, 1986."},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/BF00248250","volume":"2","author":"J-H. You","year":"1986","unstructured":"You, J-H. and P.A. Subrahmanyam, \u201cA class of confluent term rewriting systems and unification,\u201d in Journal of Automated Reasoning Vol. 2 (1986) 391\u2013418.","journal-title":"Journal of Automated Reasoning"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"You, J-H. \u201cOuter narrowing for equational theories based on constructors,\u201d in Proc. 15th ICALP, Tampere, Finland, July, 1988.","DOI":"10.1007\/3-540-19488-6_153"},{"key":"25_CR33","unstructured":"Yukawa, K., \u201cAmalgamating functional and relational programming through the use of equality axioms,\u201d Ph.D. Thesis, Dept. of Computer Science, Univ. of Waterloo, 1987."}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:08:25Z","timestamp":1561356505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}