Sciweavers

24 search results - page 4 / 5
» Recursive Types Are not Conservative over F
Sort
View
ICFP
2005
ACM
14 years 5 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
POPL
2010
ACM
14 years 3 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
KDD
2003
ACM
190views Data Mining» more  KDD 2003»
14 years 6 months ago
Distance-enhanced association rules for gene expression
We introduce a novel data mining technique for the analysis of gene expression. Gene expression is the effective production of the protein that a gene encodes. We focus on the cha...
Aleksandar Icev, Carolina Ruiz, Elizabeth F. Ryder
VLDB
1999
ACM
97views Database» more  VLDB 1999»
13 years 10 months ago
Relational Databases for Querying XML Documents: Limitations and Opportunities
XML is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML d...
Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhan...
POPL
2008
ACM
14 years 6 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...