CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Nils Anders Danielsson (Institutionen för data- och informationsteknik, Datavetenskap, Programmeringslogik (Chalmers))
2007. - 53 s.
[Rapport]

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



Denna post skapades 2007-11-20. Senast ändrad 2013-08-13.
CPL Pubid: 61984