Advertisement

Unified Relational Framework for Programming Paradigm Combination

Chapter
  • 140 Downloads
Part of the Applied Logic Series book series (APLS, volume 3)

Abstract

The goal of this work is to provide a clean formal framework to support a development methodology for programs integrating modules of different paradigms (e.g., Horn clauses modules, equational modules, functional modules, constraints based modules, …) Modules can be developed each in its own paradigm, the framework presents a uniform and high-level view allowing to make reasoning about those modules, to build them using a uniform methodology and to combine them adequately in a realistic program.

Keywords

Logic Program Implementation Strategy Operational Semantic Deduction System Language Restriction 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Apt. Logic programming. In J Van Leeuwen, editor, Handbook of Theoretical Computer Science :Formal Models and Semantics, chapter 10, pages 493–574. Elsevier-The MIT Press, 1992.Google Scholar
  2. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of Fourth ACM Symposium on Programming Languages (POPL’77), pages 238–252, Los Angeles, California, January 1977.Google Scholar
  3. E.F. Codd. A Relational Model of Data for Large Shared Data Banks. Communications of the ACM, 13(6):377–387, 1970.CrossRefzbMATHGoogle Scholar
  4. P. De Boeck and B. Le Charlier. Mechanical Transformation of Logic Definitions augmented with Type Information into Prolog Procedures: Some Experiments. In Proceedings of (LOPSTR’93), Workshops in Computer Science. Springer Verlag, July 1993.Google Scholar
  5. Y. Deville. Logic Programming: Systematic Program Development. International Series in Logic Programming. Addison-Wesley, Wokingham, United Kingdom, 1990.Google Scholar
  6. M. Fitting. A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 2(4):295–312, 1985.CrossRefzbMATHMathSciNetGoogle Scholar
  7. J. Henrard and B. Le Charlier. FOLON: An environment for Declarative Construction of Logic Programs (extended abstract). In M. Bruynooghe and M. Wirsing, editors, Proceedings of the Fourth International Workshop on Programming Language Implementation and Logic Programming (PLILP’92), Lecture Notes in Computer Science, Leuven, August 1992. Springer-Verlag.Google Scholar
  8. K. Kunen. Negation in Logic Programming. Journal of Logic Programming, 4(4):289–308, 1987.CrossRefzbMATHMathSciNetGoogle Scholar
  9. B. Le Charlier and S. Rossi. Extending the folon environment for automatically deriving totally correct prolog procedures from logic description. In Proc. WLPE’95 Seventh Workshop on Logic Programming Environments, (in conjunction with ILPS’95), Portland, Oregon, USA, December 1995.Google Scholar
  10. B. Le Charlier and P. Van Hentenryck. A general top-down fixpoint algorithm (revised version). Technical Report 93–22, Institute of Computer Science, University of Namur, Belgium, June 1993.Google Scholar
  11. B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog. ACM Transactions on Programming Languages and Systems (TOPLAS), January 1994.Google Scholar
  12. J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation Series. Springer-Verlag, Heidelberg, Germany, second edition, 1987.Google Scholar
  13. A. Rauzy. Toupie: a Constraint Language for Model Checking. In Andreas Podelski, editor, Constraint Programming : Basics and Trends, Proceedings of the 1994 Chatillon Spring School, Chatillon-sur-Seine, France, May 1994, number 910 in Lecture Notes in Computer Science. Springer-Verlag, March 1995.Google Scholar
  14. A. Tarski and F.B. Thompson. Some General Properties of Cylindric Algebras. Bulletin of the Amer. Math. Soc., 58:65, 1952.Google Scholar
  15. J.D. Ullman. Principles of Database and Knowldge Base Systems. Computer Science Press, 1989.Google Scholar

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  1. 1.Institut d’InformatiqueUniversity of NamurBelgium

Personalised recommendations