1592 search results - page 212 / 319 » On the Equality of Probabilistic Terms |
195
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
278
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
289
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
270
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
162
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...