Nils Anders Danielsson and Patrik Jansson. Chasing bottoms -- A case study in program verification in the presence of partial and infinite values. In 7th International Conference on Mathematics of Program Construction. LNCS, Springer-Verlag, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Polytypic Functional Programming and Data Abstraction - Iglesias (2006) (Correct)
No context found.
Nils Anders Danielsson and Patrik Jansson. Chasing bottoms -- A case study in program verification in the presence of partial and infinite values. In 7th International Conference on Mathematics of Program Construction. LNCS, Springer-Verlag, 2004.
TypeCase: A Design Pattern for Type-Indexed Functions - Bruno Oliveira And (2005) (1 citation) (Correct)
No context found.
N. A. Danielsson and P. Jansson. Chasing bottoms: A case study in program verification in the presence of partial and infinite values. In D. Kozen, editor, LNCS 3125: Mathematics of Program Construction, pages 85--109. Springer-Verlag, 2004.
Proof Methods for Corecursive Programs - Gibbons, Hutton (2005) (1 citation) (Correct)
No context found.
Danielsson, N., Jansson, P.: Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values, in: Proceedings of the 7th International Conference on Mathematics of Program Construction, vol. 3125 of Lecture Notes in Computer Science, Springer, Stirling, Scotland, July 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC