Sciweavers

584 search results - page 87 / 117
» Logic Programs as term Rewriting Systems
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
MIDDLEWARE
2007
Springer
14 years 1 months ago
Life cycle support for sensor network applications
Developing applications for sensor networks is a challenging task. Most programming systems narrowly focus on programming issues while ignoring that programming represents only a ...
Urs Bischoff, Gerd Kortuem
PPDP
2005
Springer
14 years 27 days ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
PLILP
1994
Springer
13 years 11 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
ICSOC
2004
Springer
14 years 24 days ago
Hybrid web service composition: business processes meet business rules
Over the last few years several process-based web service composition languages have emerged, such as BPEL4WS and BPML. These languages define the composition on the basis of a pr...
Anis Charfi, Mira Mezini