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

Autor:	Weegen, E.E. van der, McKinna, J.H., Berardi, Stefano, Liquori, Ugo de
Přispěvatelé:	Berardi, Stefano, Liquori, Ugo de
Rok vydání:	2009
Předmět:	Data Science Lecture Notes in Computer Science
Zdroj:	Berardi, Stefano; Liquori, Ugo de (ed.), Types for Proofs International Conference, TYPES 2008 Torino, Italy, 256-271. Berlin / Heidelberg : Springer STARTPAGE=256;ENDPAGE=271;ISSN=0302-9743;TITLE=Berardi, Stefano; Liquori, Ugo de (ed.), Types for Proofs International Conference, TYPES 2008 Torino, Italy Berardi, Stefano; Liquori, Ugo de (ed.), Types for Proofs International Conference, TYPES 2008 Torino, Italy, pp. 256-271
ISSN:	0302-9743
Popis:	Item does not contain fulltext Types for Proofs International Conference, TYPES 2008 Torino, Italy, 26 maart 2008
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4a6066737aa728f33d5188cfeec638bc https://hdl.handle.net/2066/76114 Zobrazit plný text záznamu