Sciweavers

77 search results - page 7 / 16
» Towards Rewriting in Coq
Sort
View
RTA
2005
Springer
14 years 1 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 10 months ago
Towards scalable data integration under constraints
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
George Konstantinidis, José Luis Ambite
ECBS
2009
IEEE
130views Hardware» more  ECBS 2009»
14 years 2 months ago
Validating and Dynamically Adapting and Composing Features in Concurrent Product-Lines Applications
With the pressing in-time-market towards customized services, software product lines (SPL) are increasingly characterizing most of software landscape. SPL are mainly structured th...
Nasreddine Aoumeur, Kamel Barkaoui, Gunter Saake
ENTCS
2007
111views more  ENTCS 2007»
13 years 7 months ago
Extra Variables Can Be Eliminated from Functional Logic Programs
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
Javier de Dios Castro, Francisco Javier Lóp...
TPHOL
2007
IEEE
14 years 2 months ago
Separation Logic for Small-Step cminor
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
Andrew W. Appel, Sandrine Blazy