632 search results - page 98 / 127 » Proving Invariants of Functional Programs |
139
Voted
DAGSTUHL
1996
15 years 4 months ago
1996
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
122
Voted
SIAMJO
2008
15 years 2 months ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
165
Voted
JMLR
2012
13 years 5 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
225
Voted
POPL
2007
ACM
16 years 2 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...
137
Voted
POPL
2010
ACM
16 years 21 hour ago
2010
ACM
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...