Sciweavers

917 search results - page 138 / 184
» On the Semantics of Updates in a Functional Language
Sort
View
HASKELL
2005
ACM
14 years 1 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
ESOP
1999
Springer
14 years 6 hour ago
An Idealized MetaML: Simpler, and More Expressive
MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme....
Eugenio Moggi, Walid Taha, Zine-El-Abidine Benaiss...
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 9 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
TPLP
2002
69views more  TPLP 2002»
13 years 7 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
SMC
2010
IEEE
124views Control Systems» more  SMC 2010»
13 years 6 months ago
SoftFacts: A top-k retrieval engine for ontology mediated access to relational databases
—We outline SoftFacts, an ontology mediated top-k information retrieval system over relational databases. An ontology layer is used to define (in terms of a OWL-QL like Semantic...
Umberto Straccia