{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T06:37:45Z","timestamp":1648535865722},"reference-count":59,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1988]]},"DOI":"10.1051\/ita\/1988220302711","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T15:39:05Z","timestamp":1486049945000},"page":"271-310","source":"Crossref","is-referenced-by-count":1,"title":["Logic and functional programming by retractions"],"prefix":"10.1051","volume":"22","author":[{"given":"M.","family":"Bellia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[Abramson84] ABRAMSON H., A Prological Definition of HASL, a Purely Functional Language with Unification Based Conditional Binding Expressions, New Generation Computing, Vol. 2, 1984, pp. 3-35.","DOI":"10.1007\/BF03037050"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[Backus78] BACKUS J., Can Programming be Liberated from the von Neumann Style?C. ACM, Vol. 21, 1978, pp, 613-6415203920383.68013","DOI":"10.1145\/359576.359579"},{"key":"R3","unstructured":"[Barendregt84] BARENDREGT H. P., The LAMBDA Calculus. Its Syntax and Semantics. North-Holland, 1984.7749520551.03007"},{"key":"R4","unstructured":"[Barbuti85] BARBUTI R., BELLIA M., LEVI G. and MARTELLI M., LEAF : A Language which Integrates Logic, Equations and Functions, Relations and Equations, D. DEGROOT and G. LINDSTROM, Eds. Prentice-Hall, 1985."},{"key":"R5","unstructured":"[Bellia83] BELLIA M., LEVI G. and MARTELLI M., On Compiling Prolog Programs on Demand Driven Architectures, Proc. Logic Programming Workshop'83, 1983, pp. 518-535."},{"key":"R6","unstructured":"[Bellia84] BELLA M., DAMERI E., DEGANO P., LEVI G. and MARTELLI M., A Formal Model for Lazy Implementation of a PROLOG Compatible Functional Language. In Implementations of PROLOG, J. A. CAMPBELL, Ed. Ellis Horwood, 1984, pp. 309-326."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[Bellia86] BELLIA M. and LEVI G., The Relation Between Logic and Functional Languages : A Survey. J. Logic Programming, 3, 1986, pp. 217-236.0599.68014","DOI":"10.1016\/0743-1066(86)90014-2"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"[Bellia87] BELLIA M., Retractions : A Functional Paradigm for Logic Programming. Proc. TAPSOFT'87, LNCS, 250, Springer-Verlag, 1987,pp. 260-275.9006200636.68012","DOI":"10.1007\/BFb0014985"},{"key":"R9","unstructured":"[Bellia88] BELLIA M. , Logic and Functional Programming by Retractions : Operational Semantics.To appear in RAIRO Informatique Th\u00e9orique et Applications.923149845840666.68012"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"[Berkling75] BERKLING K., Reduction Languages for Reduction Machines. Proc. 2nd Int. Symp. on Computer Architectures, IEEE Comp. Society Press, 1975, pp. 133-140.","DOI":"10.1145\/642089.642112"},{"key":"R11","unstructured":"[Berkling82] BERKLING K., ROBINSON J. A. and SIBERT E. E., A Proposal for a Fifth Generation Logic and Functional Programming System,Based on Highly Parallel Reduction Machine Architecture, Syracuse University, November 1982."},{"key":"R12","unstructured":"[Bowen82] BOWEN K. A. and KOWALSKI R. A., Amalgamating Language and Metalanguage in Logic Programming. In Logic Programming, K. L. CLARK and S. -A. TARNLUND, Eds., Academic Press, 1982, pp. 153-172."},{"key":"R13","unstructured":"[Bowen85] BOWEN K. A. and WEINBERG T., A Meta-level Extension of Prolog, Proc. 1985Symp. on Logic Programming IEEE Comp. Society Press 1985, pp. 48-53."},{"key":"R14","unstructured":"[Byrd80] BYRD L., Understanding the Control Flow of Prolog Programs, First Work-shop on Logic Programming, 1980pp. 127-138."},{"key":"R15","unstructured":"[van Caneghem84] M. VAN CANEGHEM and D. H. D. WARREN (Eds.), Logic Programming and its Applications, Ablex Pub. Comp., 1984."},{"key":"R16","unstructured":"[Clark82] CLARK K. L., MCCABE F. G. and GREGORY S., IC-Prolog : Language Features. In Logic Programming, K. L. CLARK and S.-A. TARNLUND, Eds., Academic Press, 1982, pp. 254-266."},{"key":"R17","unstructured":"[Clark83] CLARK K. L. and GREGORY S., PARLOG : a Parallel Logic Programming Language, Imperial College Research Report 83\/5, May 1983."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"[Clarke80] CLARKE T. J. W., GLADSTONE P. J. S., MACLEAN C. D. and NORMAL A. C., SKIM-The S. K. I. reduction machine, Proc. Lisp 80 Conf., 1980, pp. 128-135.","DOI":"10.1145\/800087.802798"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"[Darlington81] DARLINGTON J. and REEVE M. , ALICE : A Multiprocessor Reduction Machine for the Parallel Evaluation of Applicative Languages. Proc. Int. Symp. Functional Programming Languages and Computer Architectures, 1981, pp. 32-62.","DOI":"10.1145\/800223.806764"},{"key":"R20","unstructured":"[Darlington85] DARLINGTON J., FIELD A. J. and PULL H., The Unification of Functional and Logic Languages, In Logic Programming: Functions, Relations and Equations, D. DEGROOT and G. LINDSTROM Eds. Prentice-Hall, 1985."},{"key":"R21","unstructured":"[Dershowitz84] DERSHOWITZ N. and JOSEPHSON N. A., Logic Programming by Comple-tion, Proc. 2nd Int. Logic Programming Conf., 1984, pp. 313-320."},{"key":"R22","unstructured":"[Dershowitz85] DERSHOWITZ N. and PLAISTED D. A., Logic Programming Cum Applicative Programming, Proc. 1985Symp. on Logic Programming, IEEE Comp. Society Press, 1985, pp. 54-66."},{"key":"R23","unstructured":"[Fribourg85] FRIBOURG L., SLOG : A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. Proc. 1985Symp. on Logic Programming, IEEE Comp. Society Press, 1985, pp. 172-184."},{"key":"R24","unstructured":"[Gallaire82] GALLAIRE H. and LASSERRE C., A control Metalanguage for Logic ProgrammingIn Logic Programming, K. L. CLARK and S.-A. TARNLUND Eds., Academic Press, 1982, pp. 173-185."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"[Goguen84] GOGUEN J. A. and MESEGUER J., Equality, types, modules and (why not?) generics for logic programming, J. Logic Programming, Vol. 1, 1984, pp. 179-210.7598450575.68091","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"[Hankin85] HANKIN C. L., OSMAN P. E. and SHUTE M. J., COBWEB - A Combinator Reduction Architecture, Proc. Functional Programming Languages and Computer Architecture, LNCS, Vol. 201, Springer-Verlag, 1985, pp. 89-102.","DOI":"10.1007\/3-540-15975-4_32"},{"key":"R27","unstructured":"[Hsiang83] HSIANG J. and DERSHOWITZ N., Rewrite Methods for Clausal and Non-clausal Theorem Proving, Proc 10th ICALP, 1983.0523.68080"},{"key":"R28","unstructured":"[Khan81] KAHN K. M., Uniform : A Language Based Upon Unification which Unifies Much of Lisp, Prolog and Actl, Proc, 7th IJCAI, 1981."},{"key":"R29","unstructured":"[Kluge80] KLUGE W. E. and SCHLUTTER H., An Architecture for the Direct Execution of Reduction Languages, Proc: Int. Workshop High Level Computer architecture, 1980."},{"key":"R30","doi-asserted-by":"crossref","unstructured":"[Kowalski71] KOWALSKI R. A. and KUEHNER D., Linear resolution with selection function, Artificial Intelligence, Vol. 2, 1971, pp. 227-260.4366770234.68037","DOI":"10.1016\/0004-3702(71)90012-9"},{"key":"R31","unstructured":"[Kowalski74] KOWALSKI R. A., Predicate Logic as a Programming Language, Proc. Kowalski74] R. IFIP Congress, 1974, 569-574.4287650297.68006"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"[Kowalski79] KOWALSKI R. A., Algorithms = Logic + Control., C. ACM, Vol. 22, 1979, pp. 424-436.0404.68010","DOI":"10.1145\/359131.359136"},{"key":"R33","unstructured":"[Komorowski82] KOMOROWSKI H. J., QLOG - The Programming Environment for Prolog in Lisp. In Logic Programming, K. L. CLARK and S.-A. TARNLUND Eds., Academie Press 1982, pp. 315-322."},{"key":"R34","unstructured":"[Kornfeld83] KORNFELD W. A., Equality for PROLOG, Proc. 8th IJCAI, 1983, pp.514-519."},{"key":"R35","doi-asserted-by":"crossref","unstructured":"[Lindstrom85] LINDSTROM G., Functional Programming and the Logical Variable, Proc. 12th ACM Symp. on Principles of Programming Languages, 1985.","DOI":"10.1145\/318593.318657"},{"key":"R36","doi-asserted-by":"crossref","unstructured":"[Lloyd84] LLOYD J. W., Foundations of Logic Programming, Springer-Verlag, 1984.7665620547.68005","DOI":"10.1007\/978-3-642-96826-6"},{"key":"R37","unstructured":"[Mago80] MAGO G. A., A Cellular Computer Architecture for Functional Programming, Proc. IEEE-COMPCON 80, IEEE Comp. Society Press, 1980, pp. 179-187."},{"key":"R38","doi-asserted-by":"crossref","unstructured":"[McCarthy60] MCCARTHY J., Recursive Functions and Symbolic Expressions and Their Computation by Machine, C. ACM, Vol. 3, 1960, pp. 184-195.0101.10413","DOI":"10.1145\/367177.367199"},{"key":"R39","unstructured":"[Mellish84] MELLISH C. and HARDY S., Integrating PROLOG in the POPLOG Environment. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp. 147-162."},{"key":"R40","doi-asserted-by":"crossref","unstructured":"[Milner72] MILNER R., Implementation and Application of Scotts Logic for Computable Function, Sigplan Notices, Vol. 7 1972, pp. 1-6.","DOI":"10.1145\/942578.807067"},{"key":"R41","unstructured":"[Moto-Oka82] T. MOTO-OKA, Ed., Fifth Generation Computer Systems, North-Holland, 1982.0484.68002"},{"key":"R42","unstructured":"[Pereira82] PEREIRA L. M., Logic Control with Logic. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp.177-193."},{"key":"R43","unstructured":"[Reddy85] REDDY U. S., 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":"R44","doi-asserted-by":"crossref","unstructured":"[Rety85] RETY P., KIRCHNER C., KIRCHNER H. and LESCANNE P., NARROWER : A New Algorithm for Unification and its Application to Logic Programming, Proc. First Int. Conf. on Rewriting Techniques and Applications, 1985.0576.68002","DOI":"10.1007\/3-540-15976-2_7"},{"key":"R45","doi-asserted-by":"crossref","unstructured":"[Robinson65] ROBINSON J. A., A Machine-oriented Logic Based on the Resolution Principle, J. ACM, Vol. 12, 1965, pp. 23-44.1704940139.12303","DOI":"10.1145\/321250.321253"},{"key":"R46","unstructured":"[Robinson82] ROBINSON J. A. and SIBERT E. E., LOGLISP : Motivations, Design and Implementation. In Logic Programming, K. L. CLARK and S.-A. TARNLUND Eds., Academie Press, 1982, pp. 299-314.1628816"},{"key":"R47","unstructured":"[Robinson82] ROBINSON J. A. and SIBERT E. E., LOGLISP : An Alternative to PROLOG, Machine Intelligence, Vol. 10, Ellis Horwood, 1982."},{"key":"R48","doi-asserted-by":"crossref","unstructured":"[Robinson83] ROBINSON J. A., Logic Programming : Past, Present and Future, New Generation Computing, Vol. 2, 1983, pp. 107-124.","DOI":"10.1007\/BF03037419"},{"key":"R49","unstructured":"[Sato84] SATO M. and SAKURAI T., Qute : a Functional Language Based on Unification, Proc. FGCS'84, 1984, pp.157-165."},{"key":"R50","doi-asserted-by":"crossref","unstructured":"[Scott76] SCOTT D., Data Types as Lattices, SIAM J. on Computing, Vol. 5, 1976, pp. 522-587.4373300337.02018","DOI":"10.1137\/0205037"},{"key":"R51","unstructured":"[Shapiro86] SHAPIRO , E. and TERLING L., The Art of Prolog, MIT Press, 1986.0605.68002"},{"key":"R52","unstructured":"[Stoy77] STOY J. E., Denotational Semantics. The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, 1977.4889690503.68059"},{"key":"R53","doi-asserted-by":"crossref","unstructured":"[Shwartz75] SHWARTZ J. T., Automatic Data Structure Choise in a Language of Very High Level, C. ACM, Vol. 18, 1975, pp. 772-728.0316.68012","DOI":"10.1145\/361227.361235"},{"key":"R54","unstructured":"[Srivastava85] SRIVASTAVA A., OXLEY D. and SRIVASTAVA A., An(other) Integration of Logic and Functional Programming, Proc. 1985 Symp. on Logic Programming, IEEE Comp. Society Press, 1985, pp. 254-260."},{"key":"R55","unstructured":"[Subrahmanyam84] SUBRAHMANYAM P. A. and You J.-H., FUNLOG = -Functions 4-Logic: A Computational Model Integrating Functional and Logic Programming, Proc. 1984, Int.Symp. on Logic Programming, IEEE Comp. Society Press, 1984, pp.144-153."},{"key":"R56","unstructured":"[Turner79] TURNER D. A., SASL Language Manual, Dept. of Computational Science, Univ. of St. Andrews, 1979."},{"key":"R57","unstructured":"[Warren82] WARREN D. H. D., Higher-order Extensions to PROLOG : are they Needed? Machine Intelligence, Vol. 10, 1982, pp. 441-454."},{"key":"R58","unstructured":"[Yasuura84] YASUURA H., On Parallel Computational Complexity of Unification, Proc. FGCS'84, 1984, pp. 235-243."},{"key":"R59","unstructured":"[Yokomori84] YOKOMORI T., A Note on the Set Abstraction in Logic Programming Language, Proc. FGCS' 84, 1984, pp.333-340."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220302711\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:05:25Z","timestamp":1568786725000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1988220302711"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":59,"journal-issue":{"issue":"3"},"alternative-id":["ita1988220302711"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1988220302711","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}