Well-typed logic programs are not wrong

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2024, Issue , 2001, Pages 280-295

  Deransart, Pierre ^a   Smaus, Jan Georg ^b  

^a INRIA ROCQUENCOURT   (France)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FUNCTIONAL PROGRAMMING; RECONFIGURABLE HARDWARE; SEMANTICS;

LOGIC PROGRAMS; OPERATIONAL PROPERTIES; POLYMORPHIC RECURSION; PROOF-THEORETIC SEMANTICS; SUBJECT REDUCTION; TOPDOWN; TYPE SYSTEMS;

LOGIC PROGRAMMING;

EID: 84958974792     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44716-4_18     Document Type: Conference Paper

References (30)

1. K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of the Conference on Mathematical Foundations of Computer Science, volume 711 of LNCS, pages 1-19. Springer-Verlag, 1993.
2. C. Beierle. Type inferencing for polymorphic order-sorted logic programs. In L. Sterling, editor, Proceedings of the Twelfth International Conference on Logic Programming, pages 765-779. MIT Press, 1995.
3. A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. Journal of Logic Programming, 19/20:149-197, 1991.
4. M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Proving properties of logic programs by abstract diagnosis. In M. Dams, editor, Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop, volume 1192 of LNCS, pages 22-50. Springer-Verlag, 1996.
5. P. Cousot and R. Cousot: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th Symposium on Principles of Programming Languages, pages 238-252. ACM Press, 1977.
6. P. Deransart and J. Maluszyński. A Grammatical View of Logic Programming. MIT Press, 1993.
7. P. Deransart and J. Maluszyński. Towards soft typing for CLP. In F. Fages, editor, JICSLP'98 Post-Conference Workshop on Types for Con- straint Logic Programming. École Normale Supérieure, 1998. Available at http://discipl.inria.fr/TCLP98/.
8. P. Deransart and J.-G. Smaus. Well-typed logic programs are not wrong. Technical Report RR-4082, INRIA, 2000. Available via CoRR: http://arXiv.org/archive/cs/intro.html.
9. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. Theoretical Computer Science, 69(3):289-318, 1989.
10. R. Giacobazzi, S. K. Debray, and G. Levi. Generalized semantics and abstract inter- pretation for constraint logic programs. Journal of Logic Programming, 25(3):191-247, 1995.
11. M. Hanus. Logic Programming with Type Specifications, chapter 3, pages 91-140. In [23].
12. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
13. P. M. Hill and R. W. Topor. A Semantics for Typed Logic Programs, chapter 1, pages 1-61. In [23]. 2000
14. S. Kahrs. Limits of ML-definability. In H. Kuchen and S. D. Swierstra, editors, Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming, volume 1140 of LNCS, pages 17-31. Springer-Verlag, 1996.
15. A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type reconstruction in the presence of polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):290-311, 1993.
16. T.K. Lakshman and U.S. Reddy: Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system. In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Symposium on Logic Programming, pages 202-217. MIT Press, 1991.
17. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
18. P. Louvet and O. Ridoux. Parametric polymorphism for Typed Prolog and λProlog. In H. Kuchen and S. D. Swierstra, editors, Proceedings of the 8th Symposium on Programming Language Implementations and Logic Programming, volume 1140 of LNCS, pages 47-61. Springer-Verlag, 1996.
19. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348-375, 1978.
20. A. Mycroft and R. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
21. G. Nadathur and F. Pfenning. Types in Higher-Order Logic Programming, chap- ter 9, pages 245-283. In [23].
22. R. A. O'Keefe. The Craft of Prolog. MIT Press, 1990.
23. F. Pfenning, editor. Types in Logic Programming. MIT Press, 1992.
24. O. Ridoux, P. Boizumault, and F. Malésieux: Typed static analysis: Application to groundness analysis of Prolog and λProlog. In A. Middeldorp and T. Sato, editors, Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming, volume 1722 of LNCS, pages 267-283. Springer-Verlag, 1999.
25. J.-G. Smaus, F. Fages, and P. Deransart. Using modes to ensure subject reduction for typed logic programs with subtyping. In S. Kapoor and S. Prasad, editors, Proceedings of the 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1974 of LNCS. Springer-Verlag, 2000.
26. J.-G. Smaus, P. M. Hill, and A. M. King. Mode analysis domains for typed logic programs. In A. Bossi, editor, Proceedings of the 9th International Workshop on Logic-based Program Synthesis and Transformation, volume 1817 of LNCS, pages 83-102, 2000.
27. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17-64, 1996.
28. P. Tarau, K. De Bosschere, and B. Demoen. On Delphi lemmas and other mem- oing techniques for deterministic logic programs. Journal of Logic Programming, 30(2):145-163, 1997.
29. Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.
30. Simon Thompson. Miranda: The Craft of Functional Programming. Addison- Wesley, 1995.