Sciweavers

226 search results - page 38 / 46
» Extensional Theories and Rewriting
Sort
View
PPDP
2007
Springer
14 years 1 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
SEMWEB
2010
Springer
13 years 5 months ago
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
POPL
2005
ACM
14 years 8 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
ICFP
2008
ACM
14 years 7 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
ASAP
2005
IEEE
87views Hardware» more  ASAP 2005»
14 years 1 months ago
Expression Synthesis in Process Networks generated by LAURA
The COMPAAN/LAURA [18] tool chain maps nested loop applications written in Matlab onto reconfigurable platforms, such as FPGAs. COMPAAN rewrites the original Matlab application a...
Claudiu Zissulescu, Bart Kienhuis, Ed F. Depretter...