Sciweavers

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

11

ICLP
1999
Springer

favoriteEmaildiscussreport

117views Automated Reasoning» more ICLP 1999»

Binding-time Analysis for Mercury

13 years 8 months ago

Binding-time Analysis for Mercury

Download eprints.ecs.soton.ac.uk

In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available in Mercury programs, that allows the analyser to reason with partially static data structures. The analysis is polyvariant, and deals with the module structure and higher-order capabilities of Mercury programs.

Wim Vanhoof, Maurice Bruynooghe

Real-time Traffic

Automated Reasoning | ICLP 1999 | Mercury Programs | Programming Language Mercury | Static Data Structures |

claim paper

Related Content

» Green process design green energy and sustainability A systems analysis perspective

» BindingTime Analysis and the Taming of C Pointers

» Polyvariant BindingTime Analysis For Applicative Languages

» A Polyvariant BindingTime Analysis for Offline Partial Deduction

» BindingTime Analysis for Standard ML

» PERs from Projections for BindingTime Analysis

» BindingTime Analysis in Partial Evaluation One Size Does Not Fit All

» Fully Automatic BindingTime Analysis for Prolog

» BindingTime Analysis for Polymorphic Types

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICLP
Authors	Wim Vanhoof, Maurice Bruynooghe

Comments (0)