Sciweavers

IFL
2004
Springer
13 years 10 months ago
A Virtual Machine for Functional Logic Computations
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
Sergio Antoy, Michael Hanus, Jimeng Liu, Andrew P....
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
13 years 10 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
13 years 10 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
IFL
2004
Springer
13 years 10 months ago
General Homomorphic Overloading
Alexander V. Shafarenko, Sven-Bodo Scholz
IFL
2004
Springer
13 years 10 months ago
Shrinking Reductions in SML.NET
One performance-critical phase in the SML.NET compiler involves rewriting intermediate terms to monadic normal form and performing non-duplicating β-reductions. We present an impe...
Nick Benton, Andrew Kennedy, Sam Lindley, Claudio ...
Formal Methods
Top of PageReset Settings