Towards modular binding-time analysis for first-order Mercury

Electronic Notes in Theoretical Computer Science

Volumn 30, Issue 2, 2000, Pages 189-198

  Vanhoof, Wim ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; PROGRAM COMPILERS; SOFTWARE ENGINEERING;

BINDING-TIME ANALYSIS (BTA); LOGIC PROGRAMMING LANGUAGE; REAL-WORLD APPLICATIONS;

LOGIC PROGRAMMING;

EID: 19144368823     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80639-5     Document Type: Conference Paper

References (3)

1. Jones N.D., Gomard C.K., Sestoft P. Partial Evaluation and Automatic Program Generation. 1993;Prentice Hall
2. Somogyi Zolta., Henderson Fergu., Conway Thoma. The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming. 29:November 1996;1-3. 17 - 64, October-
3. W. Vanhoof and M. Bruynooghe. Binding-time analysis for mercury. In D. De Schreye, editor, 16th International Conference on Logic Programming. MIT Press, 1999. To Appear.