Skip to main content
Conference ProceedingsOPEN ACCESS

A polymorphic type system with subtypes for Prolog

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 300 LNCS 79-93
DOI: 10.1007/3-540-19027-9_6
16Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

From a software engineering point of view, logic programming lacks many properties allowing secure development of large programs by many programmers. In this paper we try to improve these properties by proposing a polymorphic type system for Prolog. Our type system is able to deal with subtype relations if information about dataflow within clauses is available. This information can be given by a mode system. We give an outline of a type checking algorithm for this type system and discuss several problems which do not arise in type systems without subtypes.

Cite

CITATION STYLE

APA

Dietrich, R., & Hagl, F. (1988). A polymorphic type system with subtypes for Prolog. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 300 LNCS, pp. 79–93). Springer Verlag. https://doi.org/10.1007/3-540-19027-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free