Logic Programming over Polymorphically Order-Sorted Types

Abstract

This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higher-order functional programming, with the notion of order-sorted typing, which has been developed for equational rst-order speci cation and programming. Polymorphically order-sorted types are obtained as canonical models of a class of speci cations in a suitable logic accommodating sort functions. Algorithms for constraint solving, type checking and type inference are given and proven correct.

Extracted Key Phrases

Statistics

01020'92'95'98'01'04'07'10'13'16
Citations per Year

115 Citations

Semantic Scholar estimates that this publication has 115 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Smolka1989LogicPO, title={Logic Programming over Polymorphically Order-Sorted Types}, author={Gert Smolka}, year={1989} }