Sciweavers

57 search results - page 3 / 12
» Towards Scalable Partial Evaluation of Declarative Programs
Sort
View
HICSS
2003
IEEE
138views Biometrics» more  HICSS 2003»
13 years 11 months ago
Towards Verifying Parametrised Hardware Libraries with Relative Placement Information
Abstract— This paper presents a framework for verifying compilation tools for parametrised hardware libraries with placement information. Such libraries are captured in Pebble, a...
Steve McKeever, Wayne Luk, Arran Derbyshire
FLOPS
2004
Springer
13 years 9 months ago
LIX: an Effective Self-applicable Partial Evaluator for Prolog
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
Stephen-John Craig, Michael Leuschel
JNSM
2008
130views more  JNSM 2008»
13 years 5 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
SIGMOD
2008
ACM
90views Database» more  SIGMOD 2008»
14 years 5 months ago
Toward best-effort information extraction
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
Warren Shen, Pedro DeRose, Robert McCann, AnHai Do...
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 10 days ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...