{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:43Z","timestamp":1725663343930},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:30:11Z","timestamp":1330183811000},"page":"21-29","source":"Crossref","is-referenced-by-count":1,"title":["Functional extensions to prolog: Are they needed?"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Fribourg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","unstructured":"Barbuti, R., Bellia, M., Levi, G., Martelli, M., \"LEAF: A Language which Integrates Logic, Equations and Functions\", in Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Linstrom, eds., Prentice-Hall, 1986, pp. 201\u2013238."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"M. Bellia","year":"1986","unstructured":"Bellia, M., Levi G., \"The Relation between Logic and Functional Languages: A Survey\", J. Logic Programming 3:3, Oct. 1986, pp. 217\u2013236.","journal-title":"J. Logic Programming"},{"key":"2_CR3","first-page":"89","volume":"250","author":"P.G. Bosco","year":"1987","unstructured":"Bosco, P.G., Giovannetti, E., Moiso, C., \"Refined Strategies for Semantic Unification\", Proc. TAPSOFT, LNCS 250, Springer-Verlag, 1987, pp. 89\u201395.","journal-title":"LNCS"},{"key":"2_CR4","unstructured":"Bosco, P.G., Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C., \"A Complete Characterization of K-LEAF, a Logic Language with Partial Functions\", Proc. Intl. Symp. on Logic Programming, 1987, pp. 89\u201395."},{"key":"2_CR5","unstructured":"Cheong, P.H., \"Techniques de mise en oeuvre de langages logico-fonctionnels\", D.E.A. Report, Laboratoire d'Informatique de l'Ecole Normale Superieure, Paris, 1988."},{"key":"2_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0031371","volume-title":"Natural Language Communication with Computers","author":"A. Colmerauer","year":"1978","unstructured":"Colmerauer, A., \"Metamorphosis Grammars\", in Natural Language Communication with Computers, LNCS 63, Springer-Verlag, New York, 1978, pp. 133\u2013189."},{"key":"2_CR7","unstructured":"Deransart, P., \"An Operational Algebraic Semantics of PROLOG Programs\" Proc. Programmation en Logique, Perros-Guirrec, CNET-Lannion, Mar. 1983."},{"key":"2_CR8","unstructured":"Dershowitz, N., Plaisted, D., \"Logic Programming cum Applicative Programming\", Proc. IEEE Intl. Symp. on Logic Programming, Boston, MA, 1985, pp. 54\u201366."},{"key":"2_CR9","unstructured":"Fay, M., \"First-order unification in an equational theory\", Proc. Fourth Workshop on Automated Deduction, Austin, TX, 1979, pp. 161\u2013167."},{"key":"2_CR10","first-page":"259","volume":"170","author":"L. Fribourg","year":"1984","unstructured":"Fribourg, L., \"A Narrowing Procedure for Theories with Constructors\", Proc. Intl. Conf. on Automated Deduction, LNCS 170, 1984, pp. 259\u2013301.","journal-title":"LNCS"},{"key":"2_CR11","unstructured":"Fribourg, L., \"SLOG: a Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting\", Proc. IEEE Intl. Symp. on Logic Programming, Boston, MA, 1985, pp. 172\u2013184."},{"key":"2_CR12","unstructured":"Fribourg, L., \"PROLOG with Simplification\", 1st France-Japan Symp. on Artifical Intelligence and Computer Science, Fuchi and Nivat, eds., Elsevier Science Publishers B.V. (North-Holland), 1988, pp. 161\u2013183."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Giovanetti, E., Moiso, C., \"A Completeness Result for E-unification Algorithms Based on Conditional Narrowing\", Fundations of Logic and Functional Programming, LNCS 306, Springer-Verlag, 1988, pp.157\u2013167.","DOI":"10.1007\/3-540-19129-1_7"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"1","author":"J.A. Goguen","year":"1984","unstructured":"Goguen, J.A., Meseguer, J., \"Equality, Types, Modules and (why not?) Generics for Logic Programming\", J. Logic Programming, Vol. 1, NO 2, 1984, pp. 179\u2013210.","journal-title":"J. Logic Programming"},{"key":"2_CR15","unstructured":"Hansson, A., Haridi, S., Tarnlund, S.-A., \"Properties of a Logic Programming Language\", in Logic Programming, K. Clark and S.-A. Tarnlund, eds., Academic Press, 1982, pp. 267\u2013280."},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00264362","volume":"24","author":"S. Heilbrunner","year":"1987","unstructured":"Heilbrunner, S., Holldobler, S., \"The Undecidability of the Unification and Matching Problem for Canonical Theories\", Acta Informatica, Vol. 24, No. 2, 1987, pp. 157\u2013171.","journal-title":"Acta Informatica"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Hullot, J.M., \"Canonical Forms and Unification\", Proc. Fifth Conf. on Automated Deduction, Les Arcs, France, 1980, pp. 318\u2013334.","DOI":"10.21236\/ADA087640"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Hussmann H., \"Unification in Conditional-Equational Theories\", Proc. EUROCAL 85 Conf., Linz, 1985.","DOI":"10.1007\/3-540-15984-3_328"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","volume":"1","author":"J. Jaffar","year":"1984","unstructured":"Jaffar, J., Lassez, J.L., Maher, M.J., \"A Theory of Complete Logic Programs with Equality\", J. Logic Programming, Vol. 1, No. 3, 1984, pp. 211\u2013223.","journal-title":"J. Logic Programming"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Kaplan, K., \"Fair Conditional Term Rewriting Systems: Unification, Termination and Confluency\", Technical Report, Laboratoires de Recherche en Informatique, U. Paris-Sud, Orsay, France, 1984.","DOI":"10.1007\/978-3-662-09691-8_11"},{"key":"2_CR21","unstructured":"Kowalski, R., \"Logic Programming\", Information Processing, R.E.A. Mason, ed., Elsevier Science Publishers B.V. (North-Holland), 1983, pp. 133\u2013145."},{"key":"2_CR22","unstructured":"Nutt, W., Rety, P., Smolka, G., \"Basic Narrowing Revisited\", Technical Report SR-87-07, U. Kaiserslautern, 1987."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","volume":"13","author":"F.C.N. Pereira","year":"1980","unstructured":"Pereira, F.C.N., Warren, H.D., \"Definite Clause Grammars for Language Analysis: a Survey of the Formalism and a Comparison with the Augmented Transition Networks\", Artificial Intelligence 13, 1980, pp. 231\u2013278.","journal-title":"Artificial Intelligence"},{"key":"2_CR24","first-page":"73","volume-title":"Machine Intelligence, Vol. 7","author":"G.D. Plotkin","year":"1972","unstructured":"Plotkin, G.D., \"Building-in Equational Theories\", in Machine Intelligence, Vol. 7, B. Meltzer and D. Michie (eds.), Halsted, Wiley, NY, 1972, pp. 73\u201390."},{"key":"2_CR25","unstructured":"Reddy, U.S., \"Narrowing as the Operational Semantics of Functional Languages, Proc. IEEE Intl. Symp. on Logic Programming, Boston, MA, 1985, pp. 138\u2013151."},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"20","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A., \"A Machine-Oriented Logic Based on the Resolution Principle\", J. Association for Computing Machinery, Vol. 20, 1965, pp. 23\u201341.","journal-title":"J. Association for Computing Machinery"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"Slagle, J.R., \"Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity\", J. Association for Computing Machinery, Vol. 21, No 4, 1974, pp. 622\u2013642.","journal-title":"J. Association for Computing Machinery"},{"key":"2_CR28","unstructured":"Subrahmanyam, P.A., You, J.H., \"Conceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming\", Proc. IEEE Intl. Symp. on Logic Programming, Atlantic City, NJ, 1984, pp. 144\u2013153."},{"key":"2_CR29","unstructured":"Tamaki, H., \"Semantics of a Logic Programming Language with a Reducibility Predicate\", Proc. IEEE Symposium on Logic Programming, Atlantic City, Feb. 1984, pp. 259\u2013264."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0743-1066(87)90013-6","volume":"4","author":"A. Togashi","year":"1987","unstructured":"Togashi, A., Noguchi, S., \"A Program Transformation from Equational Programs into Logic Programs\", J. Logic Programming 4, 1987, pp. 85\u2013103.","journal-title":"J. Logic Programming"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0743-1066(87)90006-9","volume":"4","author":"M.H. Emden Van","year":"1987","unstructured":"Van Emden, M.H., Yukawa, K., \"Logic Programming with Equations\", J. Logic Programming 4, 1987, pp. 265\u2013288.","journal-title":"J. Logic Programming"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"You, J.-H., Subrahmanyam, P.A., \"E-Unification Algorithms for a Class of Confluent Term Rewriting Systems\", Intl. Colloquium on Automata, Languages and Programming Languages, LNCS 226, Springer-Verlag, 1986, pp. 454\u2013463.","DOI":"10.1007\/3-540-16761-7_95"}],"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_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:08:58Z","timestamp":1561356538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}