The Implementation of Polymorphic Many-Dorted Type System for Logic Programming Language Gödel
- Resource Type
- Conference
- Authors
- Li, Hui-qi; Zhao, Zhi-zhuo
- Source
- 2010 Second WRI Global Congress on Intelligent Systems Intelligent Systems (GCIS), 2010 Second WRI Global Congress on. 1:102-106 Dec, 2010
- Subject
- Robotics and Control Systems
Signal Processing and Analysis
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Semantics
Logic programming
Data structures
Algorithm design and analysis
Compounds
Computer languages
Delay
logic programming
parametric polymorphism
many-sorted
type checking
- Language
- ISSN
- 2155-6083
2155-6091
Gödel is a declarative logic programming language succeeded to prolog. One of its important characteristics is polymorphic many-sorted type system. In this paper, we first introduce a notion of typed first order language. Then give the definitions of types and type expression for the polymorphic type system. And we provide the data structures and algorithms for implementing polymorphic many-sorted types checking, dynamic type matching and type inference. The coral implementation techniques of Gödel compiler related to polymorphic many-sorted types are also represented.