Type Inference in Prolog and Its Application

Kanamori, Tadashi; Horiuchi, Kenji

Type Inference in Prolog and Its Application

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Logic Programming. 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.

Tadashi Kanamori, and Kenji Horiuchi. 1985. Type Inference in Prolog and Its Application. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 704–706. https://ijcai.org/proceedings/1985/137

@inproceedings{ijcai1985p137,
  title     = {Type Inference in Prolog and Its Application},
  author    = {Kanamori, Tadashi and Horiuchi, Kenji},
  booktitle = {Proceedings of the Ninth International Joint Conference on
               Artificial Intelligence, {IJCAI-85}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Aravind Joshi},
  pages     = {704--706},
  year      = {1985},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1985/137},
}

TY  - CPAPER
TI  - Type Inference in Prolog and Its Application
AU  - Kanamori, Tadashi
AU  - Horiuchi, Kenji
T2  - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1985
SP  - 704
EP  - 706
UR  - https://ijcai.org/proceedings/1985/137
ER  -