Binding-time Analysis for Mercury

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.

• Type: Conference
• Year: 1999
• Where: ICLP
• Authors: Wim Vanhoof, Maurice Bruynooghe
• Keywords: Automated Reasoning, ICLP 1999, Mercury Programs, Programming Language Mercury, Static Data Structures