Type inference in prolog and its application

Authors:
Tadashi Kanamori;Kenji Horiuchi
Affiliations:
Central Research Laboratory, Mitsubishi Electric Corporation, Amagasaki, Hyogo, Japan;Central Research Laboratory, Mitsubishi Electric Corporation, Amagasaki, Hyogo, Japan
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 3
Cited 2

A polymorphic type system for PROLOG.

Artificial Intelligence
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)

Backward Type Inference Generalises Type Checking

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
A controlling scheme for Prolog through count terms

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. This approach not only conforms to the style of definition inherent to Prolog but also gives some accuracy to the types infered. We show the basic computation method of the superset by sequential approximation as well as an incremental method to utilize already obtained results. We also show its application to verification of Prolog programs.