Peter Fritzson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Peter Fritzson has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Henrik Nilsson
University of Nottingham, UK
2 shared publications - Mariam Kamkar1 shared publication
- Nahid Shahmehri1 shared publication
Latest Publications
- 22 November 2005
- Published by Springer Nature
- p. 117-134
Lazy algorithmic debugging: Ideas for practical implementation
- 22 November 2005
- Published by Springer Nature
- p. 117-134
Lazy algorithmic debugging: Ideas for practical implementation
- 19 November 2005
- Published by Springer Nature
- p. 60-74
Bug localization by algorithmic debugging and program slicing
- 19 November 2005
- Published by Springer Nature
- p. 60-74
Bug localization by algorithmic debugging and program slicing
- 1 April 1994
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 4 (3) , 337-369
Algorithmic debugging for lazy functional languages
Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side-effects. Traditional debugging techniques are, however, not suited for lazy functional languages, since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible. In this paper, we present an algorithmic debugger for a lazy functional language based on strictification and some experience in using it. A number of problems with the current implementation of the debugger (e.g. too large trace size and too many questions asked) are also discussed and some techniques for overcoming these problems, at least partially, are suggested. The key techniques are immediate strictification and piecemeal tracing .
- 1 April 1994
- Published by Cambridge University Press (CUP) in Journal of Functional Programming
- Vol. 4 (3) , 337-369
Algorithmic debugging for lazy functional languages
Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side-effects. Traditional debugging techniques are, however, not suited for lazy functional languages, since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible. In this paper, we present an algorithmic debugger for a lazy functional language based on strictification and some experience in using it. A number of problems with the current implementation of the debugger (e.g. too large trace size and too many questions asked) are also discussed and some techniques for overcoming these problems, at least partially, are suggested. The key techniques are immediate strictification and piecemeal tracing .