Extraction of functional from logic program

  • Susumu Yamasaki
Session: Functional And Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 528)


This paper shows a method of extracting a functional from a logic program, by means of a dataflow dealing with sequences from the set of idempotent substitutions. The dataflow is expressed as a functional involving fair merge functions in order to represent the atom set union over a sequence domain, as well as functions to act on unifiers, to reflect the unit resolution deductions virtually. The functional completely and soundly denotes the atom generation in terms of idempotent substitutions without using atom forms. Its least fixpoint is interpreted as denoting the whole atom generation in terms of manipulations on idempotent substitutions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Apt, K.R. and van Emden, M.H. (1982), Contributions to the theory of logic programming, J.ACM 29, 841–864.Google Scholar
  2. 2.
    Ashcroft, E.A. and Wadge, W.W. (1976), Lucid-A formal system for writing and proving programs, SIAM J. Comput. 5, 336–354.Google Scholar
  3. 3.
    Baudinet, M. (1988), Proving termination properties of PROLOG programs: A semantic approach, Res. Report STAN-CS-88-1202, Computer Science Dept., Stanford University.Google Scholar
  4. 4.
    Debray, S.K. and Warren, D.S. (1989), Functional computations in logic programs, ACM Trans. on Programming Languages and Systems 11, 3, 451–181.Google Scholar
  5. 5.
    Eder, E. (1985), Properties of substitutions and unifiers, J. Symbolic Computation 1, 31–46.Google Scholar
  6. 6.
    Fitting, M. (1985a), A deterministic Prolog fixpoint semantics, J. Logic Programming 2, 111–118.Google Scholar
  7. 7.
    Fitting, M. (1985b), A Kripke-Kleene semantics for logic programs, J. Logic Programming 2, 295–312.Google Scholar
  8. 8.
    Kahn, G. (1974), The semantics of a simple language for parallel programming, Proc. IFIP 74, 471–475.Google Scholar
  9. 9.
    Palamidessi, C. (1990), Algebraic properties of idempotent substitutions, Lecture Notes in Computer Science 443, 386–399.Google Scholar
  10. 10.
    Park, D. (1983), The “fairness” problem and nondeterministic computing networks, in “Foundations of Computer Science IV” (de Bakker and van Leeuwen, eds.), mathematisch Centrum, Amsterdam, 133–161.Google Scholar
  11. 11.
    Yamasaki, S. (1990), Recursion equation sets computing logic programs, Theoretical Computer Science 76, 309–322.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Susumu Yamasaki
    • 1
  1. 1.Department of Information TechnologyOkayama UniversityOkayamaJapan

Personalised recommendations