1901 search results - page 198 / 381 » Predicting Program Properties from |
157
Voted
PPDP
2004
Springer
15 years 8 months ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
139
Voted
FLOPS
2008
Springer
15 years 4 months ago
2008
Springer
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose ...
AAAI
1990
15 years 4 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
113
click to vote
JUCS
2008
15 years 3 months ago
2008
: Aspect languages provide different mechanisms to control when an aspect should apply based on properties of the execution context. They however fail to explicitly identify and cl...
140
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...