{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:43Z","timestamp":1725456163847},"publisher-location":"Berlin\/Heidelberg","reference-count":24,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354017611X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0014985","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:02:53Z","timestamp":1132725773000},"page":"260-275","source":"Crossref","is-referenced-by-count":2,"title":["Retractions: A functional paradigm for logic programming"],"prefix":"10.1007","author":[{"given":"M.","family":"Bellia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"R. Barbuti, M. Bellia, G. Levi and M. Martelli, LEAF: A language which integrates logic, equations and functions. In Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1985)."},{"key":"17_CR2","unstructured":"M. Bellia, G. Levi and M. Martelli, On compiling Prolog programs on demand driven architectures. Proc. Logic Programming Workshop'83 (1983) 518\u2013535."},{"key":"17_CR3","unstructured":"M. Bellia and G. Levi, The relation between logic and functional languages: A survey. To appear in J. Logic Programming."},{"key":"17_CR4","unstructured":"M. Bellia, Logic and functional programming by retractions: Operational semantics. In Derivable Working Group on Semantics, ESPRIT Project 415 (1986)."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"K. Berkling, Reduction languages for reduction machines. Proc. 2nd Int. Symp. on Computer Architectures (IEEE Comp. Society Press, 1975) 133\u2013140.","DOI":"10.1145\/642089.642112"},{"key":"17_CR6","unstructured":"K. Berkling, J.A. Robinson and E.E. Sibert., A proposal for a fifth generation logic and functional programming system, based on highly parallel reduction machine architecture. Syracuse University (November 1982)."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"T.J.W. Clarke, P.J.S. Gladstone, C.D. MacLean and A.C. Normal, SKIM \u2014 The S.K.I. reduction machine. Proc. Lisp 80 Conf. (1980)128\u2013135.","DOI":"10.1145\/800087.802798"},{"key":"17_CR8","unstructured":"J. Darlington and M. Reeve, ALICE: A multiprocessor reduction machine for the parallel evaluation of applicative languages. Proc. Int. Symp. Functional Programming Languages and Computer Architectures (1981) 32\u201362."},{"key":"17_CR9","unstructured":"J. Darlington, A.J. Field and H. Pull, The unification of functional and logic languages. In Logic Programming: Functions, Relations and Equations"},{"key":"17_CR10","unstructured":"N. Dershowitz and N.A. Josephson, Logic programming by completion. Proc. 2 nd Int. Logic Programming Conf. (1984),313\u2013320."},{"key":"17_CR11","unstructured":"N. Dershowitz and D.A. Plaisted, Logic programming cum applicative programming, Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985) 54\u201366."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","volume":"1","author":"J.A. GOguen","year":"1984","unstructured":"J.A. GOguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming. J. Logic Programming 1 (1984) 179\u2013210.","journal-title":"J. Logic Programming"},{"key":"17_CR13","unstructured":"J. Hsiang and N. Dershowitz, Rewrite methods for clausal and non-clausal theorem proving. Proc 10 th ICALP (1983)."},{"key":"17_CR14","unstructured":"W.E. Kluge and H. Schlutter, An architecture for the direct execution of reduction languages. Proc. Int. Workshop High Level Computer architecture (1980)."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/359131.359136","volume":"22","author":"R.A. Kowalski","year":"1979","unstructured":"R.A. Kowalski, Algorithms=Logic+Control. C. ACM, 22 (1979) 424\u2013436","journal-title":"C. ACM"},{"key":"17_CR16","first-page":"179","volume":"80","author":"G.A. Mago","year":"1980","unstructured":"G.A. Mago, A cellular computer architecture for functional programming. Proc. IEEE-COMPCON 80 (IEEE Comp. Society Press, 1980) 179\u2013187.","journal-title":"Proc. IEEE-COMPCON"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/942578.807067","volume":"7","author":"R. Milner","year":"1972","unstructured":"R. Milner, Implementation and application of Scott's logic for computable functions. Sigplan Notices, 7 (1972) 1\u20136.","journal-title":"Sigplan Notices"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"T. Moto-Oka, Ed., Fifth Generation Computer Systems. North-Holland, 1982.","DOI":"10.1145\/800046.801682"},{"key":"17_CR19","unstructured":"U.S. Reddy, Transformation of logic programs into functional programs. Proc. 1984 Int. Symp. on Logic Programming (IEEE Comp. Society Press, 1984)"},{"key":"17_CR20","unstructured":"U.S. Reddy, On the relationship between logic and functional languages. In Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1985)."},{"key":"17_CR21","unstructured":"J.A. Robinson and E.E. Sibert, LOGLISP: An alternative to PROLOG. Machine Intelligence 10 (Ellis Horwood, 1982)."},{"key":"17_CR22","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott, Data types as lattices. SIAM J. on Computing, 5 (1976)522\u2013587.","journal-title":"SIAM J. on Computing"},{"key":"17_CR23","first-page":"772","volume":"18","author":"J.T. Shwartz","year":"1975","unstructured":"J.T. Shwartz, Automatic data structure choise in a language of very high level. C. ACM, 18 (1975) 772\u2013728.","journal-title":"C. ACM"},{"key":"17_CR24","unstructured":"P.A. Subrahmanyam and J.-H. You, FUNLOG = functions + logic: A computational model integrating functional and logic programming. Proc. 1984 Int. Symp. on Logic Programming (IEEE Comp. Society Press, 1984) 144\u2013153."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0014985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:22:57Z","timestamp":1586578977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017611X"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0014985","relation":{},"subject":[]}}