1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/40097
DC FieldValue
dc.titleExtracting programs from type class proofs
dc.contributor.authorSulzmann, M.
dc.date.accessioned2013-07-04T07:56:35Z
dc.date.available2013-07-04T07:56:35Z
dc.date.issued2006
dc.identifier.citationSulzmann, 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.
dc.identifier.isbn1595933883
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40097
dc.description.abstractStandard 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.
dc.sourceScopus
dc.subjectOverloading
dc.subjectProofs are programs principle
dc.subjectType classes
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitlePPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
dc.description.volume2006
dc.description.page97-108
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.