In more detail, algorithmic debugging proceeds as follows.
The parsers for other intermediate languages simplify debugging and experimentation by making it easy to obtain inputs suitable for any given pass.
Trying to decipher such values during debugging can be quite a challenge.
In this section, related work on debugging for lazy functional languages will be reviewed and compared with our work.
To sum up, debugging of lazy functional programs is made difficult by delayed evaluation, counter-intuitive evaluation order and partially evaluated expressions.
In addition, this ideal shape grammar editor would possess debugging capabilities similar to those found in other language editors.
Any remaining redexes are instead indicated by '?' meaning that they, for the purpose of debugging, can be assumed to be correct, as discussed above.
In addition, type inference sometimes provides more useful debugging information.
