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

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférenceArticle dans les actes d'une conférence/un colloque

Résumé

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.

langue originaleAnglais
titreLogic for Programming and Automated Reasoning - 7th International Conference, LPAR 2000, Proceedings
rédacteurs en chefAndrei Voronkov, Michel Parigot
EditeurSpringer Verlag
Pages399-416
Nombre de pages18
Volume1955
ISBN (imprimé)3540412859, 9783540412854
Etat de la publicationPublié - 2000
Modification externeOui
Evénement7th International Conference on Logic for Programming and Automated Reasoning, LPAR 2000 - Reunion Island, France
Durée: 6 nov. 200010 nov. 2000

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1955
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Une conférence

Une conférence7th International Conference on Logic for Programming and Automated Reasoning, LPAR 2000
Pays/TerritoireFrance
La villeReunion Island
période6/11/0010/11/00

Empreinte digitale

Examiner les sujets de recherche de « Binding-Time analysis by constraint solving a modular and Higher-Order approach for mercury ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation