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

A Formalisation of the Correctness Result From "Lightweight Semiformal Time Complexity Analysis for Purely Functional Data Structures"
Nils Anders Danielsson
Technical report 2007:16, Department of Computer Science and Engineering, Chalmers University of Technology. [pdf]

Abstract

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

Nils Anders Danielsson
Disclaimer
Last updated Sat Feb 16 14:24:14 UTC 2008.