Fully Automatic Binding-Time Analysis for Prolog-Reference-Cited by-同舟云学术

Fully Automatic Binding-Time Analysis for Prolog

Published:2005 Issue: Volume: Page:53-68
ISSN:0302-9743
Container-title:Logic Based Program Synthesis and Transformation
language:
Short-container-title:

Author:

Craig Stephen-John,Gallagher John P.,Leuschel Michael,Henriksen Kim S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11506676_4.pdf

Reference28 articles.

1. Benoy, F., King, A., Mesnard, F.: Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming (January 2004)

2. Lecture Notes in Computer Science;D. Boulanger,1994

3. Lecture Notes in Computer Science;D. Boulanger,1994

4. Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: Kowalski, R., Bowen, K. (eds.) Proceedings of ICLP/SLP, pp. 669–683. MIT Press, Cambridge (1988)

5. Lecture Notes in Computer Science;M. Bruynooghe,1998

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Compiling Control as Offline Partial Deduction;Logic-Based Program Synthesis and Transformation;2019

2. Fast offline partial evaluation of logic programs;Information and Computation;2014-04

3. A Framework for Guided Test Case Generation in Constraint Logic Programming;Logic-Based Program Synthesis and Transformation;2013

4. Efficient local unfolding with ancestor stacks;Theory and Practice of Logic Programming;2010-01-18

5. Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation;Functional and Constraint Logic Programming;2010