A visual environment for developing context-sensitive term rewriting systems

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

Volumn 3091, Issue , 2004, Pages 301-311

  Matthews, Jacob ^a   Findler, Robert Bruce ^a   Flatt, Matthew ^b   Felleisen, Matthias ^c  

^a UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF UTAH   (United States)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL MECHANICS; COMPUTER PROGRAMMING LANGUAGES; CURRICULA; EMBEDDED SYSTEMS; MODELING LANGUAGES; PROBLEM ORIENTED LANGUAGES; PROGRAM DEBUGGING; SEMANTICS;

CONTEXT SENSITIVE; EMBEDDED DOMAIN SPECIFIC LANGUAGES; ERROR PRONES; OPERATIONAL SEMANTICS; TERM REWRITING; TERM REWRITING SYSTEMS; TYPE SOUNDNESS; VISUAL ENVIRONMENTS;

CONTEXT SENSITIVE LANGUAGES;

EID: 35048881084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_21     Document Type: Article

References (13)

1. Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theoretical Computer Science (1992) 235-271
2. Wright, A., Felleisen, M.: A syntactic approach to type soundness. Information and Computation (1994) 38-94 First appeared as Technical Report TR160, Rice University, 1991.
3. Xiao, Y., Sabry, A., Ariola, Z.M.: From syntactic theories to interpreters: Automating the proof of unique decomposition. In: Higher-Order and Symbolic Computation. Volume 4. (1999) 387-409
4. Flatt, M.: PLT MzScheme: Language manual. Technical Report TR97-280, Rice University (1997) http://www.mzscheme.org/.
5. Plotkin, G.D.: Call-by-name, call-by-value and the A-calculus. Theoretical Computer Science 1 (1975) 125-159
6. Barendregt, H.: The Lambda Calculus, Its Syntax and Semantics. Volume 103 of Studies in Logics and the Foundations of Mathematics. North Holland, Amsterdam (1981)
7. Flatt, M., Krishnamurthi, S., Felleisen, M.: A programmer's reduction semantics for classes and mixins. Formal Syntax and Semantics of Java 1523 (1999) 241-269 Preliminary version appeared in proceedings of Principles of Programming Languages, 1998. Revised version is Rice University technical report TR 97-293, June 1999.
8. 5 report of the algorithmic language Scheme. ACM SIGPLAN Notices 33 (1998) 26-76
9. Borovansky, P., Kirchner, C., Kirchner, H., Moreau, P.E., Vittek, M.: ELAN: A logical framework based on computational systems. In: Proc. of the First Int. Workshop on Rewriting Logic. Volume 4., Elsevier (1996)
10. Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science (2001)
11. Visser, E.: Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In Middeldorp, A., ed.: Rewriting Techniques and Applications (RTA'01). Volume 2051 of Lecture Notes in Computer Science., Springer-Verlag (2001) 357-361
12. van den Brand, M.G.J., Heering, J., Klint, P., Oliver, P.A.: Compiling language definitions: The ASF+SDF compiler. ACM Transactions on Programming Languages and Systems 24 (2002) 334-368
13. Lippi, S.: in2: A Graphical Interpreter for Interaction Nets (system description). In Tison, S., ed.: Rewriting Techniques and Applications, 13th International Conference, RTA-02. LNCS 2378, Copenhagen, Denmark, Springer (2002) 380-384