967 search results - page 117 / 194 » Probabilistic Predicative Programming |
129
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
140
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
216
Voted
POPL
2002
ACM
16 years 2 months ago
2002
ACM
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
122
Voted
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
112
Voted
SOCO
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...