Compiling language definitions: The ASF+SDF compiler

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 4, 2002, Pages 334-368

  Van Den Brand, M G J ^a   Heering, J ^a   Klint, P ^a   Olivier, P A ^a  

^a CWI   (Netherlands)

Author keywords

D.3.1 Programming Languages : Formal Definitions and Theory Semantics; D.3.2 Programming Languages : Language Classifications Specialized application languages; D.3.4 Programming Languages : Processors Code generation; compilers; optimization

Indexed keywords

COMPILATION; TERM REWRITING;

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER AIDED SOFTWARE ENGINEERING; DATA STORAGE EQUIPMENT; GRAPH THEORY; INTERFACES (COMPUTER); PROBABILITY; SEMANTICS;

PROGRAM COMPILERS;

EID: 0038895765     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/567097.567099     Document Type: Article

References (60)

1. ALLEN, J. R. 1978. Anatomy of Lisp. McGraw-Hill, New York, NY
2. APPEL, A. W. 1992. Compiling with Continuations. Cambridge University Press, Cambridge, UK.
3. APPEL, A. W. AND GONÇALVES, M. J. R. 1993. Hash-consing garbage collection. Technical report CS-TR-412-93, Princeton University,
4. APT, K. R., BRUNEKREEF, J. J., PARTINGTON, V., AND SCHAERF, A. 1998. Alma-0: An imperative language that supports declarative programming. ACM Trans. Program. Lang. Syst. 20, 1014-1066.
5. BENANAV, D., KAPUR, D., AND NARENDRAN, P. 1985. Complexity of matching problems. In Rewriting Techniques and Applications (RTA '85), J.-P. Jouannaud, Ed. Lecture Notes in Computer Science, vol. 202. Springer-Verlag, Berlin, Germany, 417-429.
6. BERGSTRA, J. A., HEERING, J., AND KLINT, P., Eds. 1989. Algebraic Specification. ACM Press/Addison-Wesley, Reading, MA.
7. BERGSTRA, J. A. AND KLINT, P. 1998. The discrete time ToolBus - A software coordination architecture. Sci. Comput. Program. 31, 205-229.
8. BERGSTRA, J. A. AND VAN DEN BRAND, M. G. J. 2000. Syntax and semantics of a high-level intermediate representation of ASF+SDF. Technical report SEN-R0030, CWI, Amsterdam, The Netherlands.
9. BOEHM, H. 1993. Space efficient conservative garbage collection. ACM SIGPLAN Not. 28, 6 (June), 197-206. (Proceedings of the 1991 Conference on Programming Language Design and Implementation (PLDI '91).)
10. BRUNEKREEF, J. J. 1996. A transformation tool for pure Prolog programs. In Logic Program Synthesis and Transformation (LOPSTR '96), J. P. Gallagher, Ed. Lecture Notes in Computer Science, vol. 1207. Springer-Verlag, Berlin, Germany, 130-145.
11. CLAVEL, M., DURÁN, F., EKER, S., LINCOLN, P., MARTI-OLIET, N., MESEGUER, J., AND QUESADA, J. 1999. Maude: Specification and programming in rewriting logic - Maude system documentation. Technical report, SRI International, Menlo Park, CA.
12. COURCELLE, B. AND FRANCHI-ZANNETTACCI, P. 1982. Attribute grammars and recursive program schemes I and II. Theoret. Comput. Sci. 17, 163-191 and 235-257.
13. DERSHOWITZ, N. AND JOUANNAUD, J.-P. 1990. Rewrite systems. In Handbook of Theoretical Computer Science, vol. B, J. van Leeuwen, Ed. Elsevier Science Publishers, Amsterdam, The Netherlands. 243-320.
14. DE JONGE, M. 2001. A pretty-printer for every occassion. Technical report SEN-R0115, CWI, Amsterdam, The Netherlands.
15. DIDRICH, K., FETT, A., GERKE, C., GRIESKAMP, W., AND PEPPER, P. 1994. Opal: Design and implementation of an algebraic programming language. In International Conference on Programming Languages and System Architectures, J. Gutknecht, Ed. Lecture Notes in Computer Science, vol. 782. Springer-Verlag, Berlin, Germany, 228-244.
16. DIK, C. H. S. 1989. A fast implementation of the Algebraic Specification Formalism. M.S. thesis, Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands.
17. DINESH, T. B., HAVERAAEN, M., AND HEERING, J. 2001. An algebraic programming style for numerical software and its optimization. Sci. Program. 8, 4 (Sept./Oct.), 247-259. Special issue on Coordinate-Free Numerics.
18. FIELD, A. J. AND HARRISON, P. G. 1988. Functional Programming. Addison-Wesley, Reading, MA.
19. FIELD, J. 1992. A simple rewriting semantics for realistic imperative programs and its application to program analysis. In Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (San Francisco, CA). ACM Press, New York, NY, 98-107. Also published as Technical report YALEU/DCS/RR-909, Yale University, New Haven, CT.
20. FOKKINK, W. J., KAMPERMAN, J. F. TH., AND WALTERS, H. R. 1998. Within ARM's reach: Compilation of left-linear rewrite systems via minimal rewrite systems. ACM Trans. Program. Lang. Syst. 20, 679-706.
21. FRANZ, M. 1994. Code-generation on-the-fly: A key to portable software. Ph.D. thesis, ETH Zurich, Zurich, Switzerland. Available online at ftp://ftp.inf.ethz.ch/pub/publications/ dissertations/th10497.ps.
22. GROOTE, J. F., KOORN, J. W. C., AND VAN VLIJMEN, S. F. M. 1995. The safety guaranteeing system at station Hoorn-Kersenboogaard. In Proceedings of the Tenth Annual Conference on Computer Assurance (COMPASS '95). IEEE, Computer Society Press, Los Alamitos, CA, 57-68.
23. HARTEL, P. H. ET AL. 1996. Benchmarking implementations of functional languages with "Pseudoknot," a float-intensive benchmark. J. Funct. Program. 6, 621-655.
24. HEERING, J., HENDRIKS, P. R. H., KLINT, P., AND REKERS, J. 1989. The syntax definition formalism SDF - Reference manual. SIGPLAN Not. 24, 11, 43-75. Most recent version available online at ftp.cwi.nl/pub/gipe/reports/SDFManual.ps.Z.
25. HENDRIKS, P. R. H. 1991. Implementation of modular algebraic specifications. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands.
26. HILLEBRAND, J. A. 1996. Experiments in specification re-engineering. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands.
27. HOFFMANN, C. M. AND O'DONNELL, M. J. 1982. Pattern matching in trees J. ACM 29, 68-95.
28. JONES, R. AND LINS, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, New York, NY.
29. KAMPERMAN, J. F. TH. 1996. Compilation of term rewriting systems. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands.
30. KAPLAN, S. 1987. A compiler for conditional term rewriting systems. In Rewriting Techniques and Applications (RTA '87), P. Lescanne, Ed. Lecture Notes in Computer Science, vol. 256. Springer-Verlag, Berlin, Germany, 25-41.
31. KIRCHNER, H. AND MOREAU, P.-E. 2001. Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories. J. Funct. Program. 11, 2, 207-251.
32. KLINT, P. 1993. A meta-environment for generating programming environments. ACM Trans. Softw. Eng. Meth. 2, 176-201.
33. KLOP, J. W. 1992. Term rewriting systems. In Handbook of Logic in Computer Science, vol. 2, S. Abramsky, D. Gabbay, and T. S. E. Maibaum, Eds. Oxford University Press, Oxford, UK, 1-116.
34. MOONEN, L. 1997. A generic architecture for data flow analysis to support reverse engineering. In Proceedings of the Second International Workshop on the Theory and Practice of Algebraic Specifications (ASF+SDF '97), M. P. A. Sellink, Ed. Electronic Workshops in Computing. Springer/British Computer Society, London, UK.
35. MUCHNICK, S. S. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco, CA.
36. NEDJAH, N., WALTER, C. D., AND ELDRIDGE, S. E. 1997. Optimal left-to-right pattern-matching automata. In Algebraic and Logic Programming (ALP '97/HOA '97), M. Hanus, J. Heering, and K. Meinke, Eds. Lecture Notes in Computer Science, vol. 1298. Springer-Verlag, Berlin, Germany, 273-286.
37. OLIVIER, P. A. 2002. Benchmarking of functional/algebraic language implementations. Available online at http://www.cwi.nl/~olivierp/benchmark/.
38. PEYTON JONES, S. L. 1996. Compiling Haskell by program transformation: A report from the trenches. In Programming Languages and Systems (ESOP '96), H. R. Nielson, Ed. Lecture Notes in Computer Science, vol. 1058. Springer-Verlag, Berlin, Germany, 18-14.
39. PEYTON JONES, S. L., HALL, C. V., HAMMOND, K., PARTAIN, W. D., AND WADLER, P. L. 1993. The Glasgow Haskell compiler: A technical overview. In Proceedings of Joint Framework for Information lechnology Technical Conference (JFIT), Keele, England). DTI/SERC, London, U.K., 249-257.
40. PEYTON JONES, S. L., NORDIN, T., AND OLIVA, D. 1998. C - : A portable assembly language. In Implementation of Functional Languages (IFL '97), C. Clack, K. Hammond, and T. Davie, Eds. Lecture Notes in Computer Science, vol. 1467. Springer-Verlag, Berlin, Germany, 1-19.
41. PLASMEIJER, M. J. AND VAN EEKELEN, M. C. J. D. 1994. Concurrent CLEAN - version 1.0 - Language refence manual. Technical report draft, Department of Computer Science, University of Nijmegen, Nijmegen, The Netherlands.
42. RUTTEN, E. P. B. M. AND THIÉBAUX, S. 1992. Semantics of Manifold: Specification in ASF+SDF and extension. Technical report CS-R9269, Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands.
43. SELLINK, M. P. A. AND VERHOEF, C. 2000. Development, assessment, and reengineering of language descriptions. In Fouth European Conference on Software Maintenance and Reengineering, J. Ebert and C. Verhoef, Eds. IEEE Computer Society, Los Alamitos, CA.
44. SMETSERS, S., NÖCKER, E., VAN GRONINGEN, J., AND PLASMEIJER, M. J. 1991. Generating efficient code for lazy functional languages. In Functional Programming and Computer Architecture (FPCA '91), J. Hughes, Ed. Lecture Notes in Computer Science, vol. 524. Springer-Verlag, Berlin, Germany, 592-617.
45. TERASHIMA, M. AND KANADA, Y. 1990. HLisp - Its concept, implementation and applications. J. Inform. Process. 13, 3, 265-275.
46. TIP, F. AND DINESH, T. B. 2001. A slicing-based approach for locating type errors. ACM Trans. Softw. Eng. Meth. 10, 1 (Jan.), 5-55.
47. VAN DEN BRAND, M. G. J., DE JONG, H. A., KLINT, P., AND OLIVIER, P. A. 2000. Efficient annotated terms. Softw. Pract. Exper. 30, 259-291.
48. VAN DEN BRAND, M. G. J., EIJKELKAMP, S. M., GELUK, D. K. A., MEIJER, OSBORNE, H. R., AND POLLING, M. J. F. 1995. Program transformations using ASF+SDF. In Proceedings of ASF+SDF '95. Technical Report P9504. Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands, 29-52.
49. VAN DEN BRAND, M. G. J., KLINT, P., AND OLIVIER, P. A. 1999. Compilation and memory management for ASF+SDF. In Compiler Construction (CC '99), S. Jähnichen, Ed. Lecture Notes in Computer Science, vol. 1575. Springer-Verlag, Berlin, Germany, 198-213.
50. VAN DEN BRAND, M. G. J., SELLINK, M., AND VERHOEF, C. 2000. Generation of components for software renovation factories from context-free grammars. Sci. Comput. Program. 36, 209-266.
51. VAN DEN BRAND, M. G. J., VAN DEURSEN, A., HEERING, J., DE JONG, H. A., DE JONGE, M., KUIPERS, T., KLINT, P., MOONEN, L., OLIVIER, P. A., SCHEERDER, J., VINJU, J. J., VISSER, E., AND VISSER, J. 2001. The ASF+SDF Meta-Environment: A component-based language development environment. In Compiler Construction (CC 2001), R. Wilhelm, Ed. Lecture Notes in Computer Science, vol. 2027. Springer-Verlag, Berlin, Germany, 365-370.
52. VAN DER MEULEN, E. A. 1996. Incremental typechecking. In Language Prototyping: An Algebraic Specification Approach, A. van Deursen, J. Heering, and P. Klint, Eds. AMAST Series in Computing, vol. 5. World Scientific, Singapore, 199-248.
53. VAN DEURSEN, A. 1994. Executable language definitions: Case studies and origin tracking techniques. Ph.D. thesis, University of Amsterdam, Amsterdam, The Netherlands.
54. VAN DEURSEN, A., HEERING, J., AND KLINT, P., Eds. 1996. Language Prototyping. AMAST Series in Computing, vol. 5. World Scientific, Singapore.
55. VAN DEURSEN, A. AND KLINT, P. 1998. Little languages: Little maintenance? J. Softw. Maint. 10, 75-92.
56. VAN DEURSEN, A., KLINT, P., AND VERHOEF, C. 1999. Research issues in the renovation of legacy systems. In Fundamental Approaches to Software Engineering (FASE '99), J.-P. Finance, Ed. Lecture Notes in Computer Science, vol. 1577. Springer-Verlag, Berlin, Germany, 1-21.
57. VAN DEURSEN, A. AND MOONEN, L. 2000. Exploring legacy systems using types. In Proceedings of the Seventh Working Conference on Reverse Engineering. IEEE Computer Society Press, Los Alamitos, CA, 32-41.
58. VAN ROY, P. 1993. The wonder years of sequential Prolog implementation. J. Logic Program. 19/20, 385-441.
59. VINJU, J. J. 1999. Optimizations of list matching in the ASF+SDF compiler. M.S. thesis, Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands. Available online at http://www.cwi.nl/~jurgenv/.
60. VISSER, E. 1997. Syntax definition for language prototyping. Ph.D. thesis, University of Amsterdam, Amesterdam, The Netherlands. Available online at http://www.cs.uu. nl/~visser/publications/ftp/Vis97.thesis.ps.gz.