Advertisement

Refined strategies for semantic unification

  • Pier Giorgio Bosco
  • Elio Giovannetti
  • Corrado Moiso
Session CFLP 5 Unification Of Functional And Logic Programming Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 250)

Keywords

Logic Program Logic Programming Equational Theory Unification Algorithm Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

9. References

  1. BB.
    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. DeGrott and G. Lindstrom, Eds. (Prentice-Hall, 1985), 201–238.Google Scholar
  2. BE.
    D. Bert, personal communication.Google Scholar
  3. BG.
    P.G. Bosco and E. Giovannetti, IDEAL: an Ideal DEductive Applicative Language. Proc. 1986 Symp. on Logic Programming (IEEE Comp. Society Press, 1986), 89–94.Google Scholar
  4. BR.
    D. Brand, Proving theorems with the modification method. SIAM J. Comput. 4 (1975), 412–430.Google Scholar
  5. CP.
    P.T. Cox and T. Pietrzykowski, Surface deduction: a uniform mechanism for Logic Programming. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 220–227.Google Scholar
  6. FA.
    M. Fay, First order unification in an equational theory. Proc. 4th Workshop on Automated Deduction (1979), 161–167.Google Scholar
  7. FR1.
    L. Fribourg, A narrowing procedure for theories with constructors. Proc. 7th Int. Conf. on Automated Deduction, LNCS 170 (Springer Verlag, 1984), 259–301.Google Scholar
  8. FR2.
    L. Fribourg, SLOG: A logic programming language interpreter based on clausal superposition and rewriting. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 172–184.Google Scholar
  9. GA.
    H. Gallaire, Logic programming: further developments. Proc. of the 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 88–96.Google Scholar
  10. GM.
    J.A. Goguen and J. Meseguer, Equality, types, modules and (why not?) generics for logic programming. J. Logic Programming 1 (1984), 179–210.Google Scholar
  11. HU.
    J.-M. Hullot, Canonical forms and unification. Proc. 5th Conf. on Automated Deduction, LNCS 87 (Springer Verlag, 1980), 318–334.Google Scholar
  12. KA.
    S. Kaplan, Fair conditional term rewriting systems: Unification, termination and confluence. Technical Report no. 194, University of Orsay (1984).Google Scholar
  13. MM.
    A. Martelli, C. Moiso and G.F. Rossi, An algorithm for unification in equational theories. Proc. 1986 Symp. on Logic Programming (IEEE Comp. Society Press, 1986), 180–186.Google Scholar
  14. RE.
    U.S. Reddy, Narrowing as the operational semantics of functional languages. Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 138–151.Google Scholar
  15. SU.
    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–153.Google Scholar
  16. TA.
    H. Tamaki, Semantics of a logic programming language with a reducibility predicate. Proc. of the 1984 Symp. on Logic Programming (IEEE Comp. Society Press, 1984), 259–264Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Pier Giorgio Bosco
    • 1
  • Elio Giovannetti
    • 1
  • Corrado Moiso
    • 1
  1. 1.Centro Studi E Laboratori TelecomunicazioniCSELTTorinoItaly

Personalised recommendations