---
title: "Type Inference in Prolog and Its Application"
authors:
  - "Tadashi Kanamori"
  - "Kenji Horiuchi"
doi: ""
url: "https://ijcai.org/proceedings/1985/137"
pdf: "https://ijcai.org/proceedings/1985/0137.pdf"
venue: "Proceedings of the Ninth International Joint Conference on Artificial Intelligence"
year: 1985
pages: "704-706"
track: "Logic Programming"
keywords:
---

# Type Inference in Prolog and Its Application

Tadashi Kanamori, Kenji Horiuchi

*Proceedings of the Ninth International Joint Conference on Artificial Intelligence*, pages 704-706.

## Abstract

In this paper we present a type inference method for Prolog programs. The new idea ia to describe a superset of the succeas set by aasociating a type subatitution (an anignment of sets of ground terma to variables) with each head of definite clause. Thia approach not only conforms to the style of definition inherent to Prolog but also givea aome accuracy to the types infered. We show the baaic computation method of the superset by sequential approximation aa weil aa an incremental method to utilize already obtained reaults. We also show its application to verification of Prolog programs.