ML for the working programmer
Handbook of logic in computer science (vol. 3)
Induction and recursion on the partial real line with applications to Real PCF
Theoretical Computer Science - Special issue on real numbers and computers
The Measurement Process in Domain Theory
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Constructive Topology and Combinatorics
Constructivity in Computer Science, Summer Symposium
A foundation for computation
A Renee Equation for Algorithmic Complexity
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
The Informatic Derivative at a Compact Element
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We introduce an induction principle on complete partial orders and consider its applications to program verification and analysis on the real line. The highlight of this technique is that it allows one to make inductive arguments over continuous as well as discrete forms of data without ever having to distinguish between the two.