A polymorphic type system for logic programs

This thesis develops a polymorphic type system for logic programs. Our approach is semantically oriented. We define a type language with precise semantics. Type inference rules are derived from the semantics of the type language and the semantics of logic programs. Algorithms for automatic type construction are developed based on the type inference rules. Soundness of the inference rules guarantees the soundness of the algorithms. A prototype system is implemented using a logic programming language Prolog.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Pyo, Changwoo

Contributors dc:contributor

• Reddy, Uday S.

• Computer Science

Statement dc:rights

• Copyright 1990 Pyo, Changwoo

Language dc:language

eng

Identifier

AAI9021745
(UMI)AAI9021745

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22455