Show simple item record

dc.contributor.authorSnyder, Mark H.
dc.date.accessioned2021-10-08T19:28:05Z
dc.date.available2021-10-08T19:28:05Z
dc.date.issued2007-12-31
dc.identifier.urihttp://hdl.handle.net/1808/32107
dc.descriptionThesis (M.S.)--University of Kansas, Electrical Engineering & Computer Science, 2007.en_US
dc.description.abstractThe objective of this thesis is to demonstrate the feasibility of performing static analysis, specifically type checking, in a particularly modular way. We use a term space of fixpoints of sums of functors so that, by writing individual type checkers for each portion of the entire language, we can then combine those algebras into an algebra that functions over the entire target language. The overall computational style employed uses a sequenced paramorphism to reduce the terms to the value space of types. As a proof of concept, this thesis presents a nominal typechecker in Haskell for the language Rosetta. It relies heavily on InterpreterLib, a Haskell library for designing interpreters in exactly the style described.en_US
dc.publisherUniversity of Kansasen_US
dc.rightsThis item is protected by copyright and unless otherwise specified the copyright of this thesis/dissertation is held by the author.en_US
dc.subjectApplied sciencesen_US
dc.subjectInterpreterliben_US
dc.subjectModular monadic semanticsen_US
dc.subjectRosettaen_US
dc.subjectType checkingen_US
dc.titleA modular, algebra-sequenced paramorphic constraint-based type checker for Rosettaen_US
dc.typeThesisen_US
dc.thesis.degreeDisciplineElectrical Engineering & Computer Science
dc.thesis.degreeLevelM.S.
kusw.bibid6599287
dc.rights.accessrightsopenAccessen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record