Logic Programming over Polymorphically Order-Sorted Types

Logic Programming over Polymorphically Order-Sorted Types (1989)

by Gert Smolka

Citations:

58 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	Logic Programming over Polymorphically Order-Sorted Types	SVM HeaderParse 0.2
AUTHOR NAME	Gert Smolka	user correction
AUTHOR AFFIL	German Research Center for Artificial Intelligence (DFKI)	user correction
AUTHOR ADDR	Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany	user correction
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 first-order specification and programming. Polymorphically order-sorted types are obtained as canonical models of a class of specifications in a suitable logic accommodating sort functions. Algorithms for constraint solving, type checking and type inference are given and proven correct.	user correction - Legacy Corrections
YEAR	1989	SVM HeaderParse 0.2
VENUE TYPE	TECHREPORT	INFERENCE
TECH	PhD thesis	INFERENCE
CITATIONS	18 found	ParsCit 1.0