Parametric polymorphism for typed Prolog and λProlog

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

Volumn 1140, Issue , 1996, Pages 47-61

  Louvet, Pascale ^a   Ridoux, Olivier ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Logic programming; Polymorphism; Second order Calculus; Typing

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING; POLYMORPHISM; RECONFIGURABLE HARDWARE;

A-PROLOG; COMMON LOGIC; DEDUCTION RULE; PARAMETRIC POLYMORPHISM; SECOND ORDERS; SECOND-ORDER SCHEME; SIMPLE TYPES; TYPING;

PROLOG (PROGRAMMING LANGUAGE);

EID: 84957661462     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_76     Document Type: Conference Paper

References (20)

1. H. Barendregt and K. Hemerik. Types in lambda calculi and programming languages. In N. Jones, editor, European Symp. on Programming, LNCS 432, pages 1-35, Springer- Verlag, 1990.
2. P. Brisset and O. Ridoux. The architecture of an implementation of λProlog: Prolog/Mali. In Workshop on XProlog, Philadelphia, PA, USA, 1992. ftp: //ftp.irisa.fr/locaJ/lande.
3. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322, Plenum Press, New-York, USA, 1978.
4. C.M. Elliott. Higher-order unification with dependent function types. In N. Der- schowitz, editor, 3rd Int. Conf. Rewriting Techniques and Applications, LNCS 355, pages 121-136, Springer-Verlag, 1989.
5. C.M. Elliott and F. Pfenning. A semi-functional implementation of a higher-order logic programming language. In P. Lee, editor, Topics in Advanced Language Implementation, pages 289-325, MIT Press, 1991.
6. J.-Y. Girard. Interpretation fonctionelle et elimination des coupures dans l'arithmétique d'ordre supérieur. These de doctorat d'état, Université de Paris VII, 1972.
7. M. Hanus. Horn clause programs with polymorphic types: semantics and resolution. In TAPSOFT'89, LNCS 352, pages 225-240, Springer-Verlag, 1989.
8. M. Hanus. Polymorphic higher-order programming in Prolog. In G. Levi and M. Martelli, editors, 6th Int. Conf. Logic Programming, pages 382-397, MIT Press, 1989.
9. P.M. Hill and J.W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
10. P.M. Hill and R.W. Topor. A semantics for typed logic programs. In F. Pfenning, editor, Types in Logic Programming, pages 1-62, MIT Press, 1992.
11. J. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, LNCS 19, pages 408-425, Springer-Verlag, 1974.
12. T.K. Lakshman and U.S. Reddy. Typed Prolog: a semantic reconstruction of the Mycroft-O'Keefe type system. In Int. Logic Programming Symp., pages 202-217, 1991.
13. D.A. Miller. A logical analysis of modules in logic programming. J. Logic Programming, 6(1-2):79-108, 1989.
14. D.A. Miller and G. Nadathur. Higher-order logic programming. In E. Shapiro, editor, 3rd Int. Conf. Logic Programming, LNCS 225, pages 448-462, Springer-Verlag, 1986.
15. D.A. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
16. R. Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348-375, 1978.
17. A. Mycroft and R.A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295-307, 1984.
18. G. Nadathur. A Higher-Order Logic as the Basis for Logic Programming. Ph.D. Thesis, University of Pennsylvania, 1987.
19. G. Nadathur and F. Pfenning. The type system of a higher-order logic programming language. In F. Pfenning, editor, Types in Logic Programming, pages 245-283, MIT Press, 1992.
20. F. Pfenning. Partial polymorphic type inference and higher-order unification. In ACM Conf. LISP and Functional Programming, pages 153-163, ACM Press, 1988.