Sciweavers

PLILP
1998
Springer
14 years 3 months ago
Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine
This paper shows how lazy functional programs can be made mobile by compiling them for the Java Virtual Machine. The Haskell compiler it describes is based on the h ,Gi-machine, wh...
David Wakeling
PLILP
1998
Springer
14 years 3 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
PLILP
1998
Springer
14 years 3 months ago
A Hidden Herbrand Theorem
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...
Joseph A. Goguen, Grant Malcolm, Tom Kemp
PLILP
1998
Springer
14 years 3 months ago
Compiling Erlang to Scheme
The programming languages Erlang and Scheme have many common features, yet the performance of the current implementations of Erlang appears to be below that of good implementations...
Marc Feeley, Martin Larose
PLILP
1998
Springer
14 years 3 months ago
CAT: The Copying Approach to Tabling
Bart Demoen, Konstantinos F. Sagonas
PLILP
1998
Springer
14 years 3 months ago
Logic Programming and Model Checking
We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci ca...
Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kum...
PLILP
1998
Springer
14 years 3 months ago
Embedding Multiset Constraints into a Lazy Functional Logic Language
Puri Arenas-Sánchez, Francisco Javier L&oac...
PLILP
1998
Springer
14 years 3 months ago
Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
Takahito Aoto
LOPSTR
1998
Springer
14 years 3 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel