User loginNavigation |
archivesFusion in less space
Fusion in less space. Catherine Hope and Graham Hutton
In functional programming, programs are often written in a compositional style. There are many advantages to this, such as clarity and modularity, but the resulting programs can be inefficient in terms of space, due to the use of intermediate data structures. These structures may be removed using deforestation techniques, but whether the space performance is actually improved depends on the structures being consumed in the same order that they are produced. In this paper we explore this problem and suggest a solution, in particular for lists and then generalising to trees. Since the paper discusses many examples, it is quite enjoyable to read and can even serve as an introduction to folds. By Ehud Lamm at 2005-12-07 11:39 | Functional | login or register to post comments | other blogs | 7846 reads
Workshop on Synchronization and Concurrency in OO languagesThe workshop on Synchronization and Concurrency in Object-Oriented Languages has a nice, accessible collection of papers on software transactional memory and other language-based approaches to building concurrent systems. By Sriram Srinivasan at 2005-12-07 11:57 | LtU Forum | login or register to post comments | other blogs | 5725 reads
Actual programs written in FP or FL?I've become enamored with Backus's FP language (and the lesser known follow-up FL) as of late. Does anyone know of *any* programs written in either of these languages that are outside the 1-3 line toy variety? I've found nothing. Even 10+ line toy programs would be fine, but a larger program would be even better. (For programs in a related style there's Iverson's J, but I'd still like to see some real FP programs.) ClassicJava in PLT Redex
This might be interesting to folks curious about how to formalize a real language, or about how PLT Redex works in practice. By Paul Snively at 2005-12-07 14:51 | General | Implementation | Semantics | Theory | Type Theory | login or register to post comments | other blogs | 6863 reads
Module Mania: A Type-Safe, Separately Compiled, Extensible InterpreterModule Mania: A Type-Safe, Separately Compiled, Extensible Interpreter
This is an excellent example of how the ML module language doesn't merely provide encapsulation but also strictly adds expressive power. It also demonstrates how a dynamic language (Lua) can be embedded in the statically-typed context of ML. Finally, it demonstrates that none of this need come at the expense of separate compilation or extensibility. Norman Ramsey's work is always highly recommended. By Paul Snively at 2005-12-07 14:58 | DSL | Functional | General | Implementation | Semantics | Theory | Type Theory | login or register to post comments | other blogs | 8848 reads
|
Browse archivesActive forum topics |
Recent comments
21 weeks 6 days ago
21 weeks 6 days ago
21 weeks 6 days ago
44 weeks 23 hours ago
48 weeks 2 days ago
50 weeks 2 hours ago
50 weeks 2 hours ago
1 year 3 days ago
1 year 5 weeks ago
1 year 5 weeks ago