Skapa referens, olika format (klipp och klistra)
Harvard
Rouhani-Kalleh, A. (2014) Stack Traces in Haskell. Göteborg : Chalmers University of Technology
BibTeX
@mastersthesis{
Rouhani-Kalleh2014,
author={Rouhani-Kalleh, Arash},
title={Stack Traces in Haskell},
abstract={This 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 eciency 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 di erent 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. Di erent 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 rst class values.},
publisher={Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola},
place={Göteborg},
year={2014},
note={78},
}
RefWorks
RT Generic
SR Electronic
ID 198373
A1 Rouhani-Kalleh, Arash
T1 Stack Traces in Haskell
YR 2014
AB This 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 eciency 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 di erent 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. Di erent 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 rst class values.
PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,
LA eng
LK http://publications.lib.chalmers.se/records/fulltext/198373/198373.pdf
OL 30
