[m-dev.] for review: two new kul papers

Peter Ross petdr at miscrit.be
Wed Oct 4 23:00:40 AEDT 2000


Hi,


===================================================================


Estimated hours taken: 0.5

information/include/papers.inc:
information/papers/bta_higher_order.ps.gz:
information/papers/memory_reuse_analysis.ps.gz:
    Add two new papers: "A module based analysis for
    memory reuse in Mercury" by Nancy Mazur and 
    "Binding-time analysis by constraint solving: a
    modular and higher-order approach for Mercury" by Wim Vanhoof.

news/newsdb.inc:
    Announce the new papers.


Index: information/include/papers.inc
===================================================================
RCS file: /home/mercury1/repository/w3/information/include/papers.inc,v
retrieving revision 1.20
diff -u -r1.20 papers.inc
--- information/include/papers.inc	2000/05/17 13:23:00	1.20
+++ information/include/papers.inc	2000/10/04 11:56:00
@@ -16,6 +16,62 @@
 <ul>
 <li>
 <strong>
+Binding-time analysis by constraint solving: a modular and
+higher-order approach for Mercury
+</strong>
+<br>
+Wim Vanhoof
+<br>
+<em>
+Proceedings of the Seventh International Conference on Logic for
+Programming and Automated Reasoning
+</em>,
+Reunion Island, France, November 2000.
+Lecture Notes in Computer Science 1955,
+Springer Verlag, 
+Pages 399-416
+© 
+<a href="http://www.springer.de/comp/lncs/index.html">Springer-Verlag</a>.
+<a href="papers/bta_higher_order.ps.gz">Available here (106K)</a>.
+<p>
+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.
+<p>
+
+<li>
+<strong>
+A module based analysis for memory reuse in Mercury
+</strong>
+<br>
+Nancy Mazur, Gerda Janssens and Maurice Bruynooghe
+<br>
+<em>
+Proceedings of the First International Conference on Computational Logic 
+</em>,
+London, United Kingdom, July 2000.
+Lecture Notes in Artificial Intelligence,
+Springer Verlag, 
+Pages 1255-1269
+© 
+<a href="http://www.springer.de/comp/lncs/index.html">Springer-Verlag</a>.
+<a href="papers/memory_reuse_analysis.ps.gz">Available here (93K)</a>.
+<p>
+In previous work Bruynooghe, Janssens and Kågedal developed a
+live-structure analysis for Mercury which detects memory cells available
+for reuse.  Seperate compilation of modules is an essential ingredient
+of a language such as Mercury which supports programming in the large.
+Hence, to be practical, a live-structure analysis also has to be module
+based.  This paper develops a modular live-structure analysis and
+extends it with a modular reuse analysis.  It also describes preliminary
+results obtained with a first prototype of the module based analysis.
+<p>
+
+<li>
+<strong>
 Making Mercury Programs Tail Recursive
 </strong>
 <br>
Index: information/papers/bta_higher_order.ps.gz
===================================================================
RCS file: bta_higher_order.ps.gz
diff -N bta_higher_order.ps.gz
Binary files /dev/null and bta_higher_order.ps.gz differ
Index: information/papers/memory_reuse_analysis.ps.gz
===================================================================
RCS file: memory_reuse_analysis.ps.gz
diff -N memory_reuse_analysis.ps.gz
Binary files /dev/null and memory_reuse_analysis.ps.gz differ
Index: news/newsdb.inc
===================================================================
RCS file: /home/mercury1/repository/w3/news/newsdb.inc,v
retrieving revision 1.51
diff -u -r1.51 newsdb.inc
--- news/newsdb.inc	2000/09/25 15:10:44	1.51
+++ news/newsdb.inc	2000/10/04 11:56:15
@@ -21,6 +21,15 @@
 
 $newsdb = array(
 
+"4 Oct 2000" => array("Two new papers",
+
+"Two new papers on Mercury are now available from our
+<A HREF=\"information/papers.html\">papers page</A>.
+One describes a binding-time analysis for higher order code,
+while the other describes an analysis for detecting whether a memory
+cell is available for reuse."
+),
+
 "22 Sep 2000" => array("Tuple types",
 
 "We've added support for tuple types, similar to those in most

--------------------------------------------------------------------------
mercury-developers mailing list
Post messages to:       mercury-developers at cs.mu.oz.au
Administrative Queries: owner-mercury-developers at cs.mu.oz.au
Subscriptions:          mercury-developers-request at cs.mu.oz.au
--------------------------------------------------------------------------



More information about the developers mailing list