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

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

Författare

Nils Anders Danielsson

Chalmers, Data- och informationsteknik, Datavetenskap

Ämneskategorier

Datavetenskap (datalogi)

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

Mer information

Skapat

2017-10-06