Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICLP
1995
Springer

favoriteEmaildiscussreport

100views Automated Reasoning» more ICLP 1995»

Type Inferencing for Polymorphic Order-Sorted Logic Programs

13 years 8 months ago

Type Inferencing for Polymorphic Order-Sorted Logic Programs

Download www.fernuni-hagen.de

The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if one does not employ the full power of the used type systems. We present a complete type inferencing algorithm that covers the polymorphic order-sorted types in PROTOS-L, a logic programming language that allows for polymorphism as in ML and for hierarchically structured monomorphic types.

Christoph Beierle

Real-time Traffic

Automated Reasoning | Complete Type | ICLP 1995 | Polymorphic Order-sorted Logic | Type Inferencing Algorithm |

claim paper

Related Content

» Database Programming in Machiavelli a Polymorphic Language with Static Type Inference

» A Polymorphic Intermediate Verification Language Design and Logical Encoding

» Polymorphism and separation in hoare type theory

» A NonNull Annotation Inferencer for Java Bytecode

» Polymorphic Directional Types for Logic Programming

» Firstclass Polymorphism with Type Inference

» Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages

» A FirstOrder Theory of Types and Polymorphism in Logic Programming

» Polyvariant flow analysis with higherranked polymorphic types and higherorder effect opera...

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	ICLP
Authors	Christoph Beierle

Comments (0)