Sciweavers

686 search results - page 13 / 138
» Foundations for Bidirectional Programming
Sort
View
FAC
2007
170views more  FAC 2007»
14 years 9 months ago
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Abstract. The Verifying Compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC proj...
Patrice Chalin
CIDR
2007
163views Algorithms» more  CIDR 2007»
14 years 11 months ago
Demaq: A Foundation for Declarative XML Message Processing
This paper gives an overview of Demaq, an XML message processing system operating on the foundation of transactional XML message queues. We focus on the syntax and semantics of it...
Alexander Böhm 0002, Carl-Christian Kanne, Gu...
MST
2008
121views more  MST 2008»
14 years 9 months ago
Datatype-Generic Termination Proofs
Abstract. Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs...
Roland Carl Backhouse, Henk Doornbos
POPL
2012
ACM
13 years 5 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining for proposal reviewers: lessons learned at the national science foundation
In this paper, we discuss a prototype application deployed at the U.S. National Science Foundation for assisting program directors in identifying reviewers for proposals. The appl...
Seth Hettich, Michael J. Pazzani