ITEM METADATA RECORD
Title: From monomorphic to polymorphic well-typings and beyond
Authors: Schrijvers, Tom
Gallagher, John P
Bruynooghe, Maurice #
Issue Date: Jul-2008
Publisher: Technical University of Valencia
Host Document: Pre-Proceedings of the 18th International Symposium on Logic-Based Program Synthesis and Transformation pages:3-12
Conference: Logic-Based Program Synthesis and Transformation edition:18 location:Valencia, Spain date:17-18 July, 2008
Abstract: Type information has many applications, it can be used for optimized compilation, termination analysis, error detection, ... However logic programs are typically untyped. A well-typed program has the property that it behaves identically with or without type checking. Hence the automatic inference of a well-typing is worthwhile.

Existing inferences are either cheap and inaccurate, or accurate and expensive. By giving up the concept that all calls to a predicate have types that are instances of a unique polymorphic type but instead allowing multiple polymorphic typings for the same predicate, we obtain a novel strongly-connected-component-based analysis that provides a good compromise between accuracy and computational cost.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:
File Description Status SizeFormat
paper-14.pdfextended abstract Accepted 166KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.