Logic and functional programming by retractions

 Access to full text

 Full (PDF)

1. [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. 
2. [Backus78] J. BACKUS, Can Programming be Liberated from the von Neumann Style?C. ACM, Vol. 21, 1978, pp, 613-641 Zbl0383.68013MR520392
3. [Barendregt84] H. P. BARENDREGT, The LAMBDA Calculus. Its Syntax and Semantics. North-Holland, 1984. Zbl0551.03007MR774952
4. [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. 
5. [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. 
6. [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. 
7. [Bellia86] M. BELLIA and G. LEVI, The Relation Between Logic and Functional Languages : A Survey. J. Logic Programming, 3, 1986, pp. 217-236. Zbl0599.68014
8. [Bellia87] M. BELLIA, Retractions : A Functional Paradigm for Logic Programming. Proc. TAPSOFT'87, LNCS, 250, Springer-Verlag, 1987,pp. 260-275. Zbl0636.68012MR900620
9. [Bellia88] M. BELLIA, Logic and Functional Programming by Retractions : Operational Semantics.To appear in RAIRO Informatique Théorique et Applications. Zbl0666.68012MR984584
10. [Berkling75] K. BERKLING, Reduction Languages for Reduction Machines. Proc. 2nd Int. Symp. on Computer Architectures, IEEE Comp. Society Press, 1975, pp. 133-140. 
11. [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. 
12. [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. 
13. [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. 
14. [Byrd80] L. BYRD, Understanding the Control Flow of Prolog Programs, First Work-shop on Logic Programming, 1980pp. 127-138. 
15. [van Caneghem84] M. VAN CANEGHEM and D. H. D. WARREN (Eds.), Logic Programming and its Applications, Ablex Pub. Comp., 1984. 
16. [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. 
17. [Clark83] K. L. CLARK and S. GREGORY, PARLOG : a Parallel Logic Programming Language, Imperial College Research Report 83/5, May 1983. 
18. [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. 
19. [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. 
20. [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. 
21. [Dershowitz84] N. DERSHOWITZ and N. A. JOSEPHSON, Logic Programming by Comple-tion, Proc. 2nd Int. Logic Programming Conf., 1984, pp. 313-320. 
22. [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. 
23. [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. 
24. [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. 
25. [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. Zbl0575.68091MR759845
26. [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. 
27. [Hsiang83] J. HSIANG and N. DERSHOWITZ, Rewrite Methods for Clausal and Non-clausal Theorem Proving, Proc 10th ICALP, 1983. Zbl0523.68080
28. [Khan81] K. M. KAHN, Uniform : A Language Based Upon Unification which Unifies Much of Lisp, Prolog and Actl, Proc, 7th IJCAI, 1981. 
29. [Kluge80] W. E. KLUGE and H. SCHLUTTER, An Architecture for the Direct Execution of Reduction Languages, Proc: Int. Workshop High Level Computer architecture, 1980. 
30. [Kowalski71] R. A. KOWALSKI and D. KUEHNER, Linear resolution with selection function, Artificial Intelligence, Vol. 2, 1971, pp. 227-260. Zbl0234.68037MR436677
31. [Kowalski74] R. A. KOWALSKI, Predicate Logic as a Programming Language, Proc. Kowalski74] R. IFIP Congress, 1974, 569-574. Zbl0297.68006MR428765
32. [Kowalski79] R. A. KOWALSKI, Algorithms = Logic + Control., C. ACM, Vol. 22, 1979, pp. 424-436. Zbl0404.68010
33. [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. 
34. [Kornfeld83] W. A. KORNFELD, Equality for PROLOG, Proc. 8th IJCAI, 1983, pp.514-519. 
35. [Lindstrom85] G. LINDSTROM, Functional Programming and the Logical Variable, Proc. 12th ACM Symp. on Principles of Programming Languages, 1985. 
36. [Lloyd84] J. W. LLOYD, Foundations of Logic Programming, Springer-Verlag, 1984. Zbl0547.68005MR766562
37. [Mago80] G. A. MAGO, A Cellular Computer Architecture for Functional Programming, Proc. IEEE-COMPCON 80, IEEE Comp. Society Press, 1980, pp. 179-187. 
38. [McCarthy60] J. MCCARTHY, Recursive Functions and Symbolic Expressions and Their Computation by Machine, C. ACM, Vol. 3, 1960, pp. 184-195. Zbl0101.10413
39. [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. 
40. [Milner72] R. MILNER, Implementation and Application of Scotts Logic for Computable Function, Sigplan Notices, Vol. 7 1972, pp. 1-6. 
41. [Moto-Oka82] T. MOTO-OKA, Ed., Fifth Generation Computer Systems, North-Holland, 1982. Zbl0484.68002
42. [Pereira82] L. M. PEREIRA, Logic Control with Logic. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp.177-193. 
43. [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. 
44. [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. Zbl0576.68002
45. [Robinson65] J. A. ROBINSON, A Machine-oriented Logic Based on the Resolution Principle, J. ACM, Vol. 12, 1965, pp. 23-44. Zbl0139.12303MR170494
46. [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. MR1628816
47. [Robinson82] J. A. ROBINSON and E. E. SIBERT, LOGLISP : An Alternative to PROLOG, Machine Intelligence, Vol. 10, Ellis Horwood, 1982. 
48. [Robinson83] J. A. ROBINSON, Logic Programming : Past, Present and Future, New Generation Computing, Vol. 2, 1983, pp. 107-124. 
49. [Sato84] M. SATO and T. SAKURAI, Qute : a Functional Language Based on Unification, Proc. FGCS'84, 1984, pp.157-165. 
50. [Scott76] D. SCOTT, Data Types as Lattices, SIAM J. on Computing, Vol. 5, 1976, pp. 522-587. Zbl0337.02018MR437330
51. [Shapiro86] SHAPIRO, E. and L. TERLING, The Art of Prolog, MIT Press, 1986. Zbl0605.68002
52. [Stoy77] J. E. STOY, Denotational Semantics. The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, 1977. Zbl0503.68059MR488969
53. [Shwartz75] J. T. SHWARTZ, Automatic Data Structure Choise in a Language of Very High Level, C. ACM, Vol. 18, 1975, pp. 772-728. Zbl0316.68012
54. [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. 
55. [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. 
56. [Turner79] D. A. TURNER, SASL Language Manual, Dept. of Computational Science, Univ. of St. Andrews, 1979. 
57. [Warren82] D. H. D. WARREN, Higher-order Extensions to PROLOG : are they Needed? Machine Intelligence, Vol. 10, 1982, pp. 441-454. 
58. [Yasuura84] H. YASUURA, On Parallel Computational Complexity of Unification, Proc. FGCS'84, 1984, pp. 235-243. 
59. [Yokomori84] T. YOKOMORI, A Note on the Set Abstraction in Logic Programming Language, Proc. FGCS' 84, 1984, pp.333-340. 

1. M. Bellia, Logic and functional programming by retractions : operational semantics