632 search results - page 106 / 127 » Proving Invariants of Functional Programs |
102
click to vote
LACL
2001
Springer
15 years 4 months ago
2001
Springer
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
111
Voted
PPOPP
2012
ACM
13 years 8 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
97
Voted
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
100
Voted
ICDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
106
Voted
AAECC
2005
Springer
15 years 11 days ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...