{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:03Z","timestamp":1725663063398},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_68","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:35:04Z","timestamp":1330180504000},"page":"401-425","source":"Crossref","is-referenced-by-count":9,"title":["Functional logic languages part I"],"prefix":"10.1007","author":[{"given":"Uday S.","family":"Reddy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"R. M. Burstall, D. B. MacQueen, and D. T. Sanella. Hope: an experimental applicative language. In ACM LISP Conference, pages 136\u2013143, 1980.","DOI":"10.1145\/800087.802799"},{"key":"22_CR2","unstructured":"A. Colmerauer, H. Kanouri, R. Pasero, and P. Roussel. Un Systeme de Communication Homme-machine en Francais. Research Report, Groupe Intelligence Artificielle, Universite Aix-Marseille II, 1973."},{"key":"22_CR3","unstructured":"W. F. Clocksin and C. S. Mellish. Programming in Prolog. Springer-Verlag, 1981."},{"key":"22_CR4","unstructured":"J. Darlington, A. J. Field, and H. Pull. The unification of functional and logic languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 37\u201370, Prentice-Hall, 1986."},{"key":"22_CR5","unstructured":"M. Fay. First-order unification in an equational theory. In Fourth Workshop on Automated Deduction, pages 161\u2013167, Austin, Texas, 1979."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"J-M. Hullot. Canonical forms and unification. In Conference on Automated Deduction, pages 318\u2013334, 1980.","DOI":"10.21236\/ADA087640"},{"key":"22_CR7","unstructured":"R. A. Kowalski. Logic for Problem Solving. North-Holland, 1979."},{"key":"22_CR8","unstructured":"R. Kowalski. Logic programming. In R. E. A. Mason, editor, Information Processing, pages 133\u2013145, North-Holland, 1983."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"G. Lindstrom. Functional programming and the logical variable. In ACM Symposium on Principles of Programming Languages, 1985.","DOI":"10.1145\/318593.318657"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"R Milner. A proposal for Standard ML. In ACM Symposium on LISP and Functional Programming, pages 184\u2013197, 1984.","DOI":"10.1145\/800055.802035"},{"key":"22_CR12","unstructured":"R.S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Technical Report CSG 265, MIT, 1986."},{"key":"22_CR13","unstructured":"U. S. Reddy. Narrowing as the operational semantics of functional languages. In Symposium on Logic Programming, IEEE, Boston, 1985."},{"key":"22_CR14","unstructured":"U. S. Reddy. On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 3\u201336, Prentice-Hall, 1986."},{"key":"22_CR15","unstructured":"U.S. Reddy. Logic Languages based on Functions: Semantics and Implementation. Technical Report UIUCDCS-R-86-1305, University of Illinois at Urbana-Champaign, 1986. Ph.D. thesis done at University of Utah."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"J.R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM, 21(4):622\u2013642, 1974.","journal-title":"Journal of the ACM"},{"key":"22_CR17","unstructured":"G. Smolka. Fresh: a higher-order language based on unification. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 469\u2013524, Prentice-Hall, 1986."},{"key":"22_CR18","unstructured":"M. Sato and T. Sakurai. Qute: a functional language based on unification. In Intl. Conf. Fifth Generation Computer Systems, pages 157\u2013165, ICOT, 1984."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"D.A Turner. The semantic elegance of applicative languages. In Proceedings of the 1981 conference on Functional Programming Languages and Computer Architecture, pages 85\u201392, ACM, 1981.","DOI":"10.1145\/800223.806766"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"D.A. Turner. Miranda: a non-strict functional language with polymorphic types. In J-P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 1\u201316, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15975-4_26"}],"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_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:14:55Z","timestamp":1605626095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}