EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 22 / No 3 (1988) RAIRO-Theor. Inf. Appl., 22 3 (1988) 271-310 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 22, Number 3, 1988
Page(s) 271 - 310
DOI https://doi.org/10.1051/ita/1988220302711
Published online 03 February 2017
  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. [Google Scholar]
  2. [Backus78] J. BACKUS, Can Programming be Liberated from the von Neumann Style?C. ACM, Vol. 21, 1978, pp, 613-641 [MR: 520392] [Zbl: 0383.68013] [Google Scholar]
  3. [Barendregt84] H. P. BARENDREGT, The LAMBDA Calculus. Its Syntax and Semantics. North-Holland, 1984. [MR: 774952] [Zbl: 0551.03007] [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  7. [Bellia86] M. BELLIA and G. LEVI, The Relation Between Logic and Functional Languages : A Survey. J. Logic Programming, 3, 1986, pp. 217-236. [Zbl: 0599.68014] [Google Scholar]
  8. [Bellia87] M. BELLIA, Retractions : A Functional Paradigm for Logic Programming. Proc. TAPSOFT'87, LNCS, 250, Springer-Verlag, 1987,pp. 260-275. [MR: 900620] [Zbl: 0636.68012] [Google Scholar]
  9. [Bellia88] M. BELLIA, Logic and Functional Programming by Retractions : Operational Semantics.To appear in RAIRO Informatique Théorique et Applications. [EuDML: 92314] [MR: 984584] [Zbl: 0666.68012] [Google Scholar]
  10. [Berkling75] K. BERKLING, Reduction Languages for Reduction Machines. Proc. 2nd Int. Symp. on Computer Architectures, IEEE Comp. Society Press, 1975, pp. 133-140. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  14. [Byrd80] L. BYRD, Understanding the Control Flow of Prolog Programs, First Work-shop on Logic Programming, 1980pp. 127-138. [Google Scholar]
  15. [van Caneghem84] M. VAN CANEGHEM and D. H. D. WARREN (Eds.), Logic Programming and its Applications, Ablex Pub. Comp., 1984. [Google Scholar]
  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. [Google Scholar]
  17. [Clark83] K. L. CLARK and S. GREGORY, PARLOG : a Parallel Logic Programming Language, Imperial College Research Report 83/5, May 1983. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  21. [Dershowitz84] N. DERSHOWITZ and N. A. JOSEPHSON, Logic Programming by Comple-tion, Proc. 2nd Int. Logic Programming Conf., 1984, pp. 313-320. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  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. [MR: 759845] [Zbl: 0575.68091] [Google Scholar]
  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. [Google Scholar]
  27. [Hsiang83] J. HSIANG and N. DERSHOWITZ, Rewrite Methods for Clausal and Non-clausal Theorem Proving, Proc 10th ICALP, 1983. [Zbl: 0523.68080] [Google Scholar]
  28. [Khan81] K. M. KAHN, Uniform : A Language Based Upon Unification which Unifies Much of Lisp, Prolog and Actl, Proc, 7th IJCAI, 1981. [Google Scholar]
  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. [Google Scholar]
  30. [Kowalski71] R. A. KOWALSKI and D. KUEHNER, Linear resolution with selection function, Artificial Intelligence, Vol. 2, 1971, pp. 227-260. [MR: 436677] [Zbl: 0234.68037] [Google Scholar]
  31. [Kowalski74] R. A. KOWALSKI, Predicate Logic as a Programming Language, Proc. Kowalski74] R. IFIP Congress, 1974, 569-574. [MR: 428765] [Zbl: 0297.68006] [Google Scholar]
  32. [Kowalski79] R. A. KOWALSKI, Algorithms = Logic + Control., C. ACM, Vol. 22, 1979, pp. 424-436. [Zbl: 0404.68010] [Google Scholar]
  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. [Google Scholar]
  34. [Kornfeld83] W. A. KORNFELD, Equality for PROLOG, Proc. 8th IJCAI, 1983, pp.514-519. [Google Scholar]
  35. [Lindstrom85] G. LINDSTROM, Functional Programming and the Logical Variable, Proc. 12th ACM Symp. on Principles of Programming Languages, 1985. [Google Scholar]
  36. [Lloyd84] J. W. LLOYD, Foundations of Logic Programming, Springer-Verlag, 1984. [MR: 766562] [Zbl: 0547.68005] [Google Scholar]
  37. [Mago80] G. A. MAGO, A Cellular Computer Architecture for Functional Programming, Proc. IEEE-COMPCON 80, IEEE Comp. Society Press, 1980, pp. 179-187. [Google Scholar]
  38. [McCarthy60] J. MCCARTHY, Recursive Functions and Symbolic Expressions and Their Computation by Machine, C. ACM, Vol. 3, 1960, pp. 184-195. [Zbl: 0101.10413] [Google Scholar]
  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. [Google Scholar]
  40. [Milner72] R. MILNER, Implementation and Application of Scotts Logic for Computable Function, Sigplan Notices, Vol. 7 1972, pp. 1-6. [Google Scholar]
  41. [Moto-Oka82] T. MOTO-OKA, Ed., Fifth Generation Computer Systems, North-Holland, 1982. [Zbl: 0484.68002] [Google Scholar]
  42. [Pereira82] L. M. PEREIRA, Logic Control with Logic. In Implementations of PROLOG, J. A. CAMPBELL Ed., Ellis Horwood, 1984, pp.177-193. [Google Scholar]
  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. [Google Scholar]
  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. [Zbl: 0576.68002] [Google Scholar]
  45. [Robinson65] J. A. ROBINSON, A Machine-oriented Logic Based on the Resolution Principle, J. ACM, Vol. 12, 1965, pp. 23-44. [MR: 170494] [Zbl: 0139.12303] [Google Scholar]
  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. [MR: 1628816] [Google Scholar]
  47. [Robinson82] J. A. ROBINSON and E. E. SIBERT, LOGLISP : An Alternative to PROLOG, Machine Intelligence, Vol. 10, Ellis Horwood, 1982. [Google Scholar]
  48. [Robinson83] J. A. ROBINSON, Logic Programming : Past, Present and Future, New Generation Computing, Vol. 2, 1983, pp. 107-124. [Google Scholar]
  49. [Sato84] M. SATO and T. SAKURAI, Qute : a Functional Language Based on Unification, Proc. FGCS'84, 1984, pp.157-165. [Google Scholar]
  50. [Scott76] D. SCOTT, Data Types as Lattices, SIAM J. on Computing, Vol. 5, 1976, pp. 522-587. [MR: 437330] [Zbl: 0337.02018] [Google Scholar]
  51. [Shapiro86] SHAPIRO, E. and L. TERLING, The Art of Prolog, MIT Press, 1986. [Zbl: 0605.68002] [Google Scholar]
  52. [Stoy77] J. E. STOY, Denotational Semantics. The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, 1977. [MR: 488969] [Zbl: 0503.68059] [Google Scholar]
  53. [Shwartz75] J. T. SHWARTZ, Automatic Data Structure Choise in a Language of Very High Level, C. ACM, Vol. 18, 1975, pp. 772-728. [Zbl: 0316.68012] [Google Scholar]
  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. [Google Scholar]
  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. [Google Scholar]
  56. [Turner79] D. A. TURNER, SASL Language Manual, Dept. of Computational Science, Univ. of St. Andrews, 1979. [Google Scholar]
  57. [Warren82] D. H. D. WARREN, Higher-order Extensions to PROLOG : are they Needed? Machine Intelligence, Vol. 10, 1982, pp. 441-454. [Google Scholar]
  58. [Yasuura84] H. YASUURA, On Parallel Computational Complexity of Unification, Proc. FGCS'84, 1984, pp. 235-243. [Google Scholar]
  59. [Yokomori84] T. YOKOMORI, A Note on the Set Abstraction in Logic Programming Language, Proc. FGCS' 84, 1984, pp.333-340. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.