| J. Clements, M. Flatt, and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, pages 320--334, 2001. |
No context found.
Clements, J., M. Flatt, and M. Felleisen: 2001, `Modeling an Algebraic Stepper'. In: European Symposium on Programming.
....high school algebra. A Scheme implementation must then provide a stepper that illustrates this concept, so students can easily understand a program evaluation without understanding physical notions like registers, environments, pointers, stacks, etc. Figure 1 illustrates how DrScheme s stepper [2] presents a step in the reduction sequence of a beginner program. Fig. 1. Stepping through Scheme programs Scheme is safe. Scheme s standard [6] permits implementations with fully predictable positive and negative behavior. DrScheme is such an implementation. All primitive operations totally ....
Clements, J., M. Flatt and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, 2001.
....Then the program raises an exception for ill formed inputs, and DrScheme highlights the place where the program raised the exception as if the program were an ordinary interactive program. See figure 7 for an illustration. Consider the more complex example of DrScheme s single step debugger [6]. The tool reduces Scheme programs according to Scheme s reduction semantics [12] A developer may wish to use the stepper to understand the actions on a step by step basis. The stepper already accounts for library calls as atomic function calls, so that it properly displays transitions of CGI ....
J. Clements, M. Flatt, and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, 2001.
....rather than working directly from an abstract model. Secondly, it is used as a debugging tool. Students observe the evaluation of their own programs, and can step forward and backward to locate their mistakes. The key to the construction of the stepper is the introduction of continuation marks (Clements et al. 2001). Continuation marks allow the stepper to re use the underlying Scheme implementation, without having to re implement the evaluator. As a result, the stepper and the compiler always have the same semantics. Future versions of DrScheme will extend the stepper to handle the Advanced and Full Scheme ....
....language whose binding structure is syntactically apparent. A stepper should be as useful for ML and Haskell as it is for Scheme. The stepper s implementation technique applies to both ML and Haskell, since it supports state, continuations, multiple threads of control and lazy evaluation (Clements et al. 2001). In principle, Haskell and ML would be excellent choices for teaching introductory programming. Indeed, their type discipline helps enforce our design discipline from section 2. Unfortunately, the error messages for programs that do not type check are often confusing to beginners. Consider the ....
Clements, John, Flatt, Matthew, & Felleisen, Matthias. (2001). Modeling an algebraic stepper. European Symposium on Programming.
No context found.
J. Clements, M. Flatt, and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, pages 320--334, 2001.
No context found.
John Clements, Matthew Flatt, and Matthias Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, pages 320--334, 2001.
No context found.
J. Clements, M. Flatt, and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, pages 320-334, 2001.
No context found.
Clements, J., M. Flatt and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, 2001.
No context found.
J. Clements, M. Flatt, and M. Felleisen. Modeling an algebraic stepper. In European Symposium on Programming, pages 320--334, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC