Using modes to ensure subject reduction for typed logic programs with subtyping

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

Volumn 1974, Issue , 2000, Pages 214-226

  Smaus, Jan Georg ^a   Fages, François ^b   Deransart, Pierre ^b  

^a CWI   (Netherlands)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; FORMAL LANGUAGES; LOGIC PROGRAMMING; SOFTWARE ENGINEERING;

DATAFLOW; EXECUTION MODEL; LOGIC PROGRAMS; SUBJECT REDUCTION; SUBTYPING RELATION; SUBTYPINGS; TYPE SYSTEMS;

COMPUTER CIRCUITS;

EID: 33746651223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_17     Document Type: Conference Paper

References (17)

1. [1] K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997.
2. [2] K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. Borzyszkowski and S. Sokolowski, editors, Proceedings of MFCS, LNCS, pages 1–19. Springer-Verlag, 1993.
3. [3] C. Beierle. Type inferencing for polymorphic order-sorted logic programs. In L. Sterling, editor, Proceedings of ICLP, pages 765–779. MIT Press, 1995.
4. [4] R. Dietrich and F. Hagl. A polymorphic type system with subtypes for Prolog. In H. Ganzinger, editor, Proceedings of ESOP, LNCS, pages 79–93. Springer-Verlag, 1988.
5. [5] F. Fages and M. Paltrinieri. A generict ype system for CLP(X). Technical report, Ecole Normale Sup´erieure LIENS 97-16, December 1997.
6. [6] M. Hanus. Logic Programming with Type Specifications, chapter 3, pages 91–140. MIT Press, 1992. In [12].
7. [7] P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
8. [8] P. M. Hill and R. W. Topor. A Semantics for Typed Logic Programs, chapter 1, pages 1–61. MIT Press, 1992. In [12].
9. [9] 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 ILPS, pages 202–217. MIT Press, 1991.
10. [10] A. Mycroft and R. O’Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295–307, 1984.
11. [11] G. Nadathur and F. Pfenning. Types in Higher-Order Logic Programming, chapter 9, pages 245–283. MIT Press, 1992. In [12].
12. [12] F. Pfenning, editor. Types in Logic Programming. MIT Press, 1992.
13. [13] J.-G. Smaus. Modes and Types in Logic Programming. PhD thesis, University of Kent at Canterbury, 1999.
14. [14] J.-G. Smaus, F. Fages, and P. Deransart. Using modes to ensure subject reduction for typed logicp rograms with subtyping. Technical report, INRIA, 2000. Available via CoRR: http://arXiv.org/archive/cs/intro.html.
15. [15] 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.
16. [16] K. Stroetmann and T. Glaß. A semantics for types in Prolog: The type system of pan version 2.0. Technical report, Siemens AG, ZFE T SE 1, 81730 München, Germany, 1995.
17. [17] Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.