-
1
-
-
67650069467
-
-
B. Braßel, S. Fischer, M. Hanus, F. Huch, and G. Vidal. Lazy Call-By-Value Evaluation. Technical report, CAU Kiel, 2007.
-
B. Braßel, S. Fischer, M. Hanus, F. Huch, and G. Vidal. Lazy Call-By-Value Evaluation. Technical report, CAU Kiel, 2007.
-
-
-
-
2
-
-
67650045716
-
-
A. Gill. Debugging Haskell by Observing Intermediate Data Structures. In Proc. of the 4th Haskell Workshop. Technical report of the University of Nottingham, 2000.
-
A. Gill. Debugging Haskell by Observing Intermediate Data Structures. In Proc. of the 4th Haskell Workshop. Technical report of the University of Nottingham, 2000.
-
-
-
-
5
-
-
0035643583
-
How to look busy while being as lazy as ever: The implementation of a lazy functional debugger
-
H. Nilsson. How to look busy while being as lazy as ever: the implementation of a lazy functional debugger. Journal of Functional Programming, 11(6):629-671, 2001.
-
(2001)
Journal of Functional Programming
, vol.11
, Issue.6
, pp. 629-671
-
-
Nilsson, H.1
-
6
-
-
0031126461
-
The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging
-
H. Nilsson and J. Sparud. The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging. Automated Software Engineering, 4(2): 121-150, 1997.
-
(1997)
Automated Software Engineering
, vol.4
, Issue.2
, pp. 121-150
-
-
Nilsson, H.1
Sparud, J.2
-
8
-
-
33646036192
-
Declarative Debugging with Buddha
-
V. Vene and T. Uustalu, editors, Advanced Functional Programming, 5th International School, AFP 2004, of, Springer Verlag, September, ISBN 3-540-28540-7
-
B. Pope. Declarative Debugging with Buddha. In V. Vene and T. Uustalu, editors, Advanced Functional Programming, 5th International School, AFP 2004, volume 3622 of Lecture Notes in Computer Science, pages 273-308. Springer Verlag, September 2005. ISBN 3-540-28540-7.
-
(2005)
Lecture Notes in Computer Science
, vol.3622
, pp. 273-308
-
-
Pope, B.1
-
10
-
-
0031099099
-
-
P.M. Sansom and S.L. Peyton Jones. Formally Based Profiling for HigherOrder Functional Languages. ACM Transactions on Programming Languages and Systems, 19(2):334-385, 1997.
-
P.M. Sansom and S.L. Peyton Jones. Formally Based Profiling for HigherOrder Functional Languages. ACM Transactions on Programming Languages and Systems, 19(2):334-385, 1997.
-
-
-
-
12
-
-
84957053327
-
Complete and Partial Redex Trails of Functional Computations
-
Proc. of the 9th Int'l Workshop on the Implementation of Functional Languages IFL'97
-
J. Sparud and C. Runciman. Complete and Partial Redex Trails of Functional Computations. In Proc. of the 9th Int'l Workshop on the Implementation of Functional Languages (IFL'97), pages 160-177. Springer LNCS 1467, 1997a.
-
(1997)
Springer LNCS
, vol.1467
, pp. 160-177
-
-
Sparud, J.1
Runciman, C.2
-
13
-
-
84923020668
-
Tracing Lazy Functional Computations Using Redex Trails
-
Proc. of the 9th Int'l Symp. on Programming Languages, Implementations, Logics and Programs PLILP'97
-
J. Sparud and C. Runciman. Tracing Lazy Functional Computations Using Redex Trails. In Proc. of the 9th Int'l Symp. on Programming Languages, Implementations, Logics and Programs (PLILP'97), pages 291-308. Springer LNCS 1292, 1997b.
-
(1997)
Springer LNCS
, vol.1292
, pp. 291-308
-
-
Sparud, J.1
Runciman, C.2
|