Sciweavers

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

14

FLOPS
1999
Springer

favoriteEmaildiscussreport

122views Automated Reasoning» more FLOPS 1999»

Using Types as Approximations for Type Checking Prolog Programs

13 years 8 months ago

Using Types as Approximations for Type Checking Prolog Programs

Download www.fernuni-hagen.de

Abstract. Subtyping tends to undermine the eﬀects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present a new approach for type checking logic programs to overcome these diﬃculties. The two basic ideas are, ﬁrst, to interpret a predicate type declaration as an approximation for the success set of the predicate. Second, declarations are extended with type constraints such that they can be more reﬁned than in other conventional type systems. The type system has been implemented in a system called Typical which provides a type checker for Standard Prolog enriched with type annotations.

Christoph Beierle, Gregor Meyer

Real-time Traffic

Automated Reasoning | FLOPS 1999 | Predicate Type Declaration | Type Checking Logic | Type System |

claim paper

Related Content

» Type Analysis of Prolog Using Type Graphs

» Improved Compilation of Prolog to C Using Moded Types and Determinism Information

» Modelling and Verification of IEC 61499 Applications using Prolog

» Type checking with open type functions

» Function Types in Complete Type Inference

» Dependent types and program equivalence

» EnerJ approximate data types for safe and general lowpower computation

» Typing dynamic typing

» Type inference and strong static type checking for Promela

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	FLOPS
Authors	Christoph Beierle, Gregor Meyer

Comments (0)