The Essence of Codata and Its Implementations
| dc.contributor.advisor | Ariola, Zena | |
| dc.contributor.author | Sullivan, Zachary | |
| dc.date.accessioned | 2018-09-06T22:03:33Z | |
| dc.date.available | 2018-09-06T22:03:33Z | |
| dc.date.issued | 2018-09-06 | |
| dc.description.abstract | Data types are a widely-used feature of functional programming languages that allow programmers to create abstractions and control branching computations. Instances of data types are introduced by applying one of a disjoint set of constructors and are eliminated by pattern matching on the constructor used. Dually, codata types are defined by their destructors, are introduced by copattern matching on their context, and eliminated by applying destructors. We extend motivation for codata types to include adding types that satisfy the extensional laws and adding an abstraction for constraining clients of code. We also improve on work implementing codata by developing an untyped compilation technique for codata that works for both call-by-name and call-by-value evaluation strategies and scales to simple and indexed type systems. We demonstrate the practicality of our technique by implementing a prototype compiler and a Haskell language extension. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/23832 | |
| dc.language.iso | en_US | |
| dc.publisher | University of Oregon | |
| dc.rights | All Rights Reserved. | |
| dc.subject | Codata | en_US |
| dc.subject | Compilation | en_US |
| dc.subject | Duality | en_US |
| dc.title | The Essence of Codata and Its Implementations | |
| dc.type | Electronic Thesis or Dissertation | |
| thesis.degree.discipline | Department of Computer and Information Science | |
| thesis.degree.grantor | University of Oregon | |
| thesis.degree.level | masters | |
| thesis.degree.name | M.S. |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Sullivan_oregon_0171N_12267.pdf
- Size:
- 434.31 KB
- Format:
- Adobe Portable Document Format