Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them
Licentiate thesis, 2005
partial
inductive
coinductive
non-strict
equational reasoning
lifted
infinite
functional programming
Author
Nils Anders Danielsson
Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)
Chasing Bottoms: A Case Study in Program Verification in the Presence of Partial and Infinite Values
Proceedings of the 7th International Conference on Mathematics of Program Construction, MPC 2004, LNCS 3125,;(2004)p. 85-109
Paper in proceeding
Subject Categories
Computer and Information Science
Technical report L - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 7L