Stack Traces in Haskell

dc.contributor.authorRouhani-Kalleh, Arash
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T13:23:32Z
dc.date.available2019-07-03T13:23:32Z
dc.date.issued2014
dc.description.abstractThis thesis presents ideas for how to implement Stack Traces for the Glasgow Haskell Compiler. The goal is to come up with an implementation with such small overhead that organizations do not hesitate to use it for their binaries running in production. Since the implementation is aiming for efficiency it will be heavily tied to only GHC. This work has been made possible thanks to a very recent contribution [1] that implements debug data for binaries compiled with GHC. Thanks to that contribution, this thesis can almost entirely focus on managing the GHC stack. Three different designs of stack values is presented, they allow creation in constant time and we implement one of these designs. The overhead of these designs can be kept small by utilizing laziness and the special linked list structure of the GHC stack. The other contribution is the work on the Haskell API that is exposed to programmers. We have implemented an API where the Haskell programmer can create the stack value at will and examine its content. Different ways of incorporating stack traces into the catching and throwing mechanism have been analyzed and we have found a rethrowing semantics for Haskell that is backwards compatible, convenient to use and easy to implement in GHC. The design in this paper allows stack values to be first class values.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/198373
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectData- och informationsvetenskap
dc.subjectInformations- och kommunikationsteknik
dc.subjectComputer and Information Science
dc.subjectInformation & Communication Technology
dc.titleStack Traces in Haskell
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
198373.pdf
Storlek:
966.06 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext