Sciweavers

85 search results - page 13 / 17
» Specialization of Lazy Functional Logic Programs
Sort
View
ICFP
2007
ACM
13 years 11 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
14 years 1 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
JFLP
2002
81views more  JFLP 2002»
13 years 7 months ago
A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
We present a practical partial evaluation scheme for multi-paradigm declarative languages combining features from functional, logic, and concurrent programming. In contrast to pre...
Elvira Albert, Michael Hanus, Germán Vidal
ENTCS
2008
73views more  ENTCS 2008»
13 years 8 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
13 years 11 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti