Let me jump in here and say a few things that maybe everyone already knows :).
The stepper’s annotation places a *ton* of annotation on a computation, and
allows the reconstruction of the full computation. Errortrace does less, and
provides less.
The both share a goal of allowing the programmer
Hi everyone,
I have a question about the implementation of errortrace.
Consider the classic factorial program, except that the base case is buggy:
(define (fact m)
(let loop ([n m])
(cond
[(zero? n) (/ 1 0)]
[else (* (loop (sub1 n)) n)])))
(fact 5)
Running this program with r
2 matches
Mail list logo
