A Formalisation of the Correctness Result From "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures"
Report, 2007

This document describes how the correctness result in "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures" has been formalised.

Author

Nils Anders Danielsson

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Subject Categories

Computer Science

Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University: 2007:16

More information

Created

10/6/2017