We are concerned with the extraction of tables from exchange format representations of very diverse composite documents. We put forward a flexible representation scheme for comple...
Jean-Yves Ramel, Michel Crucianu, Nicole Vincent, ...
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett