Please use this identifier to cite or link to this item:
|Title:||Extracting programs from type class proofs||Authors:||Sulzmann, M.||Keywords:||Overloading
Proofs are programs principle
|Issue Date:||2006||Citation:||Sulzmann, M. (2006). Extracting programs from type class proofs. PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming 2006 : 97-108. ScholarBank@NUS Repository.||Abstract:||Standard presentations of type class translation schemes exhibit some surprising problems when translating Haskell 98 programs. We suggests ways how to fix these problems based on a formal framework for extracting programs from type class proofs. Our description includes type improvement and recursive dictionaries - something which has not been formally studied before. Thus, we are able to advance the state of art of translating type classes and open up the possibility for new type class applications. Copyright © 2006 ACM.||Source Title:||PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming||URI:||http://scholarbank.nus.edu.sg/handle/10635/40097||ISBN:||1595933883|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.