{"title":"A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq","authors":"Eelis van der Weegen, J. McKinna","doi":"10.1007/978-3-642-02444-3_16","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":131421,"journal":{"name":"Types for Proofs and Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Types for Proofs and Programs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-02444-3_16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}