Higher-Order and Symbolic Computation, 14(4)307
EditorialOlivier Danvy, Takayasu Ito and Carolyn Talcott
|
This issue of HOSC is composed of three contributed articles. "A Network Protocol Stack in Standard ML" presents FoxNet, a complete and efficient implementation of TCP/IP using Standard ML. The article also provides an extensive overview of the Fox project, where advanced programming-language techniques are applied to systems programming. "Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation" documents a new family of algorithms for distributed garbage collection based on distributed reference counting. The article describes the design and evaluation of tree rerooting, a technique to introduce more parallelism by reducing indirect dependencies. "From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition" presents a technique for automating the standard proof of unique decomposition in the syntactic theory of a programming language. A priori, the problem reduces to proving equivalence and unambiguity of context-free grammars--two properties that are known to be undecidable. The contribution of this paper is to reduce the problem to regular tree languages, for which equivalence and unambiguity are decidable. |
![[picture of journal cover]](../LISP.JPG)