632 search results - page 61 / 127 » Proving Invariants of Functional Programs |
85
Voted
ICFP
2001
ACM
16 years 16 days ago
2001
ACM
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
113
Voted
ICML
1989
IEEE
15 years 4 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
108
Voted
PPDP
2000
Springer
15 years 4 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
120
Voted
JAIR
2008
15 years 17 days ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
114
click to vote
IAW
2003
IEEE
15 years 5 months ago
2003
IEEE
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...