Sciweavers

IFL
2004
Springer
13 years 11 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 11 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 11 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
131views Formal Methods» more  IFL 2004»
13 years 11 months ago
Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations
The message-passing paradigm is now widely accepted and used mainly for inter-process communication in distributed memory parallel systems. However, one of its disadvantages is the...
Alfredo Cristóbal-Salas, Andrey Chernykh, E...
IFL
2004
Springer
13 years 11 months ago
General Homomorphic Overloading
Alexander V. Shafarenko, Sven-Bodo Scholz
Formal Methods
Top of PageReset Settings