A Machine-checked Proof of the Average-case Complexity of Quicksort in Coq

Find Full text
Publication year
2009
Author(s)
Weegen, E.E. van der
McKinna, J.H.
Publisher
Berlin / Heidelberg : Springer
ISBN
9783642024436
In
Lecture Notes in Computer Science, (2009)Berardi, Stefano; Liquori, Ugo de (ed.), Types for Proofs International Conference, TYPES 2008 Torino, Italy, pp. 256-271
ISSN
Annotation
Types for Proofs International Conference, TYPES 2008 Torino, Italy, 26 maart 2008
Publication type
Article in monograph or in proceedings
Please use this identifier to cite or link to this item: https://hdl.handle.net/2066/76114   https://hdl.handle.net/2066/76114
Display more details

Upload full text

Use your RU credentials (u/z-number and password) to log in with SURFconext to upload a file for processing by the repository team.