4850 search results - page 372 / 970 » Proof and Computation in Geometry |
184
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
169
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
190
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
134
Voted
COLT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
180
click to vote
LICS
2006
IEEE
16 years 26 days ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...