no. 3
Logic and functional programming by retractions
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 271-310. 
@article{ITA_1988__22_3_271_0,
     author = {Bellia, M.},
     title = {Logic and functional programming by retractions},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {271--310},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {3},
     year = {1988},
     mrnumber = {963593},
     zbl = {0666.68011},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1988__22_3_271_0/}
}
TY  - JOUR
AU  - Bellia, M.
TI  - Logic and functional programming by retractions
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1988
SP  - 271
EP  - 310
VL  - 22
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1988__22_3_271_0/
LA  - en
ID  - ITA_1988__22_3_271_0
ER  - 
%0 Journal Article
%A Bellia, M.
%T Logic and functional programming by retractions
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 271-310
%V 22
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1988__22_3_271_0/
%G en
%F ITA_1988__22_3_271_0
Bellia, M. Logic and functional programming by retractions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 271-310. http://archive.numdam.org/item/ITA_1988__22_3_271_0/

[Abramson84] H. Abramson, A Prological Definition of HASL, a Purely Functional Language with Unification Based Conditional Binding Expressions, New Generation Computing, Vol. 2, 1984, pp. 3-35.

[Backus78] J. Backus, Can Programming be Liberated from the von Neumann Style?C. ACM, Vol. 21, 1978, pp, 613-641 | MR | Zbl

[Barendregt84] H. P. Barendregt, The LAMBDA Calculus. Its Syntax and Semantics. North-Holland, 1984. | MR | Zbl

[Barbuti85] R. Barbuti, M. Bellia, G. Levi and M. Martelli, LEAF : A Language which Integrates Logic, Equations and Functions, Relations and Equations, D. DEGROOT and G. LINDSTROM, Eds. Prentice-Hall, 1985.

[Bellia83] M. Bellia, G. Levi and M. Martelli, On Compiling Prolog Programs on Demand Driven Architectures, Proc. Logic Programming Workshop'83, 1983, pp. 518-535.

[Bellia84] M. Bella, E. Dameri, P. Degano, G. Levi and M. Martelli, 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.

[Bellia86] M. Bellia and G. Levi, The Relation Between Logic and Functional Languages : A Survey. J. Logic Programming, 3, 1986, pp. 217-236. | Zbl

[Bellia87] M. Bellia, Retractions : A Functional Paradigm for Logic Programming. Proc. TAPSOFT'87, LNCS, 250, Springer-Verlag, 1987,pp. 260-275. | MR | Zbl

[Bellia88] M. Bellia, Logic and Functional Programming by Retractions : Operational Semantics.To appear in RAIRO Informatique Théorique et Applications. | Numdam | MR | Zbl

[Berkling75] K. Berkling, Reduction Languages for Reduction Machines. Proc. 2nd Int. Symp. on Computer Architectures, IEEE Comp. Society Press, 1975, pp. 133-140.

[Berkling82] 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.

[Bowen82] K. A. Bowen and R. A. Kowalski, Amalgamating Language and Metalanguage in Logic Programming. In Logic Programming, K. L. CLARK and S. -A. TARNLUND, Eds., Academic Press, 1982, pp. 153-172.

[Bowen85] K. A. Bowen and T. Weinberg, A Meta-level Extension of Prolog, Proc. 1985Symp. on Logic Programming IEEE Comp. Society Press 1985, pp. 48-53.

[Byrd80] L. Byrd, Understanding the Control Flow of Prolog Programs, First Work-shop on Logic Programming, 1980pp. 127-138.

[van Caneghem84] M. VAN CANEGHEM and D. H. D. WARREN (Eds.), Logic Programming and its Applications, Ablex Pub. Comp., 1984.

[Clark82] K. L. Clark, F. G. Mccabe and S. Gregory, IC-Prolog : Language Features. In Logic Programming, K. L. CLARK and S.-A. TARNLUND, Eds., Academic Press, 1982, pp. 254-266.

[Clark83] K. L. Clark and S. Gregory, PARLOG : a Parallel Logic Programming Language, Imperial College Research Report 83/5, May 1983.

[Clarke80] T. J. W. Clarke, P. J. S. Gladstone, C. D. Maclean and A. C. Normal, SKIM-The S. K. I. reduction machine, Proc. Lisp 80 Conf., 1980, pp. 128-135.

[Darlington81] 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, pp. 32-62.

[Darlington85] J. Darlington, A. J. Field and H. Pull, The Unification of Functional and Logic Languages, In Logic Programming: Functions, Relations and Equations, D. DEGROOT and G. LINDSTROM Eds. Prentice-Hall, 1985.

[Dershowitz84] N. Dershowitz and N. A. Josephson, Logic Programming by Comple-tion, Proc. 2nd Int. Logic Programming Conf., 1984, pp. 313-320.

[Dershowitz85] N. Dershowitz and D. A. Plaisted, Logic Programming Cum Applicative Programming, Proc. 1985Symp. on Logic Programming, IEEE Comp. Society Press, 1985, pp. 54-66.

[Fribourg85] L. Fribourg, 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.

[Gallaire82] H. Gallaire and C. Lasserre, A control Metalanguage for Logic ProgrammingIn Logic Programming, K. L. CLARK and S.-A. TARNLUND Eds., Academic Press, 1982, pp. 173-185.

[Goguen84] J. A. Goguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming, J. Logic Programming, Vol. 1, 1984, pp. 179-210. | MR | Zbl

[Hankin85] C. L. Hankin, P. E. Osman and M. J. Shute, COBWEB - A Combinator Reduction Architecture, Proc. Functional Programming Languages and Computer Architecture, LNCS, Vol. 201, Springer-Verlag, 1985, pp. 89-102.

[Hsiang83] J. Hsiang and N. Dershowitz, Rewrite Methods for Clausal and Non-clausal Theorem Proving, Proc 10th ICALP, 1983. | Zbl

[Khan81] K. M. Kahn, Uniform : A Language Based Upon Unification which Unifies Much of Lisp, Prolog and Actl, Proc, 7th IJCAI, 1981.

[Kluge80] W. E. Kluge and H. Schlutter, An Architecture for the Direct Execution of Reduction Languages, Proc: Int. Workshop High Level Computer architecture, 1980.

[Kowalski71] R. A. Kowalski and D. Kuehner, Linear resolution with selection function, Artificial Intelligence, Vol. 2, 1971, pp. 227-260. | MR | Zbl

[Kowalski74] R. A. Kowalski, Predicate Logic as a Programming Language, Proc. Kowalski74] R. IFIP Congress, 1974, 569-574. | MR | Zbl

[Kowalski79] R. A. Kowalski, Algorithms = Logic + Control., C. ACM, Vol. 22, 1979, pp. 424-436. | Zbl

[Komorowski82] H. J. Komorowski, 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.

[Kornfeld83] W. A. Kornfeld, Equality for PROLOG, Proc. 8th IJCAI, 1983, pp.514-519.

[Lindstrom85] G. Lindstrom, Functional Programming and the Logical Variable, Proc. 12th ACM Symp. on Principles of Programming Languages, 1985.

[Lloyd84] J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, 1984. | MR | Zbl

[Mago80] G. A. Mago, A Cellular Computer Architecture for Functional Programming, Proc. IEEE-COMPCON 80, IEEE Comp. Society Press, 1980, pp. 179-187.

[McCarthy60] J. Mccarthy, Recursive Functions and Symbolic Expressions and Their Computation by Machine, C. ACM, Vol. 3, 1960, pp. 184-195. | Zbl

[Mellish84] C. Mellish and S. Hardy, Integrating PROLOG in the POPLOG Environment. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp. 147-162.

[Milner72] R. Milner, Implementation and Application of Scotts Logic for Computable Function, Sigplan Notices, Vol. 7 1972, pp. 1-6.

[Moto-Oka82] T. MOTO-OKA, Ed., Fifth Generation Computer Systems, North-Holland, 1982. | Zbl

[Pereira82] L. M. Pereira, Logic Control with Logic. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp.177-193.

[Reddy85] 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.

[Rety85] P. Rety, C. Kirchner, H. Kirchner and P. Lescanne, NARROWER : A New Algorithm for Unification and its Application to Logic Programming, Proc. First Int. Conf. on Rewriting Techniques and Applications, 1985. | Zbl

[Robinson65] J. A. Robinson, A Machine-oriented Logic Based on the Resolution Principle, J. ACM, Vol. 12, 1965, pp. 23-44. | MR | Zbl

[Robinson82] J. A. Robinson and E. E. Sibert, LOGLISP : Motivations, Design and Implementation. In Logic Programming, K. L. CLARK and S.-A. TARNLUND Eds., Academie Press, 1982, pp. 299-314. | MR

[Robinson82] J. A. Robinson and E. E. Sibert, LOGLISP : An Alternative to PROLOG, Machine Intelligence, Vol. 10, Ellis Horwood, 1982.

[Robinson83] J. A. Robinson, Logic Programming : Past, Present and Future, New Generation Computing, Vol. 2, 1983, pp. 107-124.

[Sato84] M. Sato and T. Sakurai, Qute : a Functional Language Based on Unification, Proc. FGCS'84, 1984, pp.157-165.

[Scott76] D. Scott, Data Types as Lattices, SIAM J. on Computing, Vol. 5, 1976, pp. 522-587. | MR | Zbl

[Shapiro86] Shapiro, E. and L. Terling, The Art of Prolog, MIT Press, 1986. | Zbl

[Stoy77] J. E. Stoy, Denotational Semantics. The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, 1977. | MR | Zbl

[Shwartz75] J. T. Shwartz, Automatic Data Structure Choise in a Language of Very High Level, C. ACM, Vol. 18, 1975, pp. 772-728. | Zbl

[Srivastava85] A. Srivastava, D. Oxley and A. Srivastava, An(other) Integration of Logic and Functional Programming, Proc. 1985 Symp. on Logic Programming, IEEE Comp. Society Press, 1985, pp. 254-260.

[Subrahmanyam84] P. A. Subrahmanyam and J.-H. You, 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.

[Turner79] D. A. Turner, SASL Language Manual, Dept. of Computational Science, Univ. of St. Andrews, 1979.

[Warren82] D. H. D. Warren, Higher-order Extensions to PROLOG : are they Needed? Machine Intelligence, Vol. 10, 1982, pp. 441-454.

[Yasuura84] H. Yasuura, On Parallel Computational Complexity of Unification, Proc. FGCS'84, 1984, pp. 235-243.

[Yokomori84] T. Yokomori, A Note on the Set Abstraction in Logic Programming Language, Proc. FGCS' 84, 1984, pp.333-340.