Binding-Time analysis by constraint solving a modular and Higher-Order approach for mercury

Research output: Contribution in Book/Catalog/Report/Conference proceedingConference contribution

Abstract

In this paper we present a binding-time analysis for the logic programming language Mercury. Binding-time analysis is a key analysis needed to perform off-line program specialisation. Our analysis deals with the higher-order aspects of Mercury, and is formulated by means of constraint normalisation. This allows (at least part of) the analysis to be performed on a modular basis.

Original languageEnglish
Title of host publicationLogic for Programming and Automated Reasoning - 7th International Conference, LPAR 2000, Proceedings
EditorsAndrei Voronkov, Michel Parigot
PublisherSpringer Verlag
Pages399-416
Number of pages18
Volume1955
ISBN (Print)3540412859, 9783540412854
Publication statusPublished - 2000
Externally publishedYes
Event7th International Conference on Logic for Programming and Automated Reasoning, LPAR 2000 - Reunion Island, France
Duration: 6 Nov 200010 Nov 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1955
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Logic for Programming and Automated Reasoning, LPAR 2000
Country/TerritoryFrance
CityReunion Island
Period6/11/0010/11/00

Fingerprint

Dive into the research topics of 'Binding-Time analysis by constraint solving a modular and Higher-Order approach for mercury'. Together they form a unique fingerprint.

Cite this