Abstract
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. © Springer-Verlag 004.
Cite
CITATION STYLE
Vanhoof, W., Bruynooghe, M., & Leuschel, M. (2004). Binding-time analysis for mercury. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3049, 189–232. https://doi.org/10.1007/978-3-540-25951-0_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
