Modeling an algebraic stepper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2028, Issue , 2001, Pages 320-334

  Clements, John ^a   Flatt, Matthew ^a,b   Felleisen, Matthias ^a  

^a Rice University   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; MACHINERY; PROGRAM COMPILERS; SEMANTICS;

BREAK-POINTS; CANONICAL FORM; COMPILER ANALYSIS; HIGH LEVEL SEMANTICS; PROGRAMMING ENVIRONMENT; REDUCTION SEMANTICS; SEMANTIC MODEL; SOURCE EXPRESSIONS;

PROGRAM DEBUGGING;

EID: 84945287629     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45309-1_21     Document Type: Conference Paper

References (24)

1. Balzer, R. M. EXDAMS — Extendable Debugging And Monitoring System. In AFIPS 1969 Spring Joint Computer Conference, volume 34, pages 567-580. AFIPS Press, May 1969.
2. Barendregt, H. P. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.
3. Bernstein, K. L. and E. W. Stark. Operational semantics of a focusing debugger. In Eleventh Conference on the Mathematical Foundations of Programming Semantics, Volume 1 of Electronic Notes in Computer Science. Elsevier, March 1995.
4. Bertot, Y. Occurrences in debugger specifications. In ACM SIGPLAN Conference on Programming Language Design and Implementation, 1991.
5. Felleisen, M. Programming languages and their calculi. Unpublished Manuscript. http://www.cs.rice.edu/~matthias/411/mono.ps.
6. Felleisen, M. and R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science, 102:235-271, 1992.
7. Ferguson, H. E. and E. Berner. Debugging systems at the source language level. Communications of the ACM, 6(8):430-432, August 1963.
8. Findler, R. B., J. Clements, C. Flanagan, M. Flatt, S. Krishnamurthi, P. Steckler and M. Felleisen. Drscheme: A programming environment for Scheme. Journal of Functional Programming, 2001.
9. Findler, R. B., C. Flanagan, M. Flatt, S. Krishnamurthi and M. Felleisen. DrScheme: A pedagogic programming environment for Scheme. In International Symposium on Programming Languages: Implementations, Logics, and Programs, number 1292 in Lecture Notes in Computer Science, pages 369-388, 1997.
10. Flatt, M., PLT MzScheme: Language manual. Technical Report TR97-280, Rice University, 1997.
11. Flatt, M., S. Krishnamurthi and M. Felleisen. Classes and mixins. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 171-183, January 1998.
12. Hall, C. and J. O’Donnell. Debugging in a side effect free programming environment. In ACM SIGPLAN symposium on Language issues in programming environments, 1985.
13. Hannan, J. and D. Miller. From operational semantics to abstract machines. Journal of Mathematical Structures in Computer Science, 2(4):415-459, 1992.
14. Kellomaki, P. Psd — a portable scheme debugger, Feburary 1995.
15. Kishon, A., P. Hudak and C. Consel. Monitoring semantics: a formal framework for specifying, implementing and reasoning about execution monitors. In ACM SIG- PLAN Conference on Programming Language Design and Implementation, pages 338-352, June 1991.
16. Krishnamurthi, S., PLT Mc MicMac: Elaborator manual. Technical Report 99-334, Rice University, Houston, TX, USA, 1999.
17. Landin, P. J. The mechanical evaluation of expressions. Comput. J., 6(4):308-320, 1964.
18. Milner, R. Communication and Concurrency. Prentice Hall, 1989.
19. Moreau, L. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation, 11(3):233-279, 1998.
20. Naish, L. and T. Barbour. Towards a portable lazy functional declarative debugger. In 19th Australasian Computer Science Conference, 1996.
21. Plotkin, G. D. Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science, pages 125-159, 1975.
22. Sansom, P. and S. Peyton-Jones. Formally-based profiling for higher-order functional languages. ACM Transactions on Programming Languages and Systems, 19(1), January 1997.
23. Sparud, J. and C. Runciman. Tracing lazy functional computations using redex trails. In Symposium on Programming Language Implementation and Logic Programming, 1997.
24. Tolmach, A. Debugging Standard ML. PhD thesis, Department of Computer Science, Princeton University, October 1992