Sciweavers

977 search results - page 106 / 196
» Logic programming with infinite sets
Sort
View
81
Voted
CSL
2009
Springer
15 years 7 months ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni
104
Voted
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
15 years 5 months ago
PiQA: An Algebra for Querying Protein Data Sets
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
Sandeep Tata, Jignesh M. Patel
209
Voted
ICDT
2009
ACM
248views Database» more  ICDT 2009»
16 years 1 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
97
Voted
ICFP
2006
ACM
16 years 17 days ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
SCCC
2005
IEEE
15 years 6 months ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....