Advertisement

Abstract

As domain-specific languages (DSLs) permeate into mainstream software engineering, there is a need for economic methods for implementing languages. Following up on a paper with a similar title, this paper focuses on dynamically typed languages, covering issues ranging from parsing to defining and staging an interpreter for an interesting subset of Dr. Scheme. Preliminary experimental results indicate that the speedups reported in previous work for smaller languages and with smaller benchmarks are maintained.

Keywords

Match Statement Logical Negation Abstract Syntax Recursive Call Concrete Syntax 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Consel, C., Danvy, O.: For a better support of static data flow. In: Hughes, R.J.M. (ed.) FPCA 1991. LNCS, vol. 523, pp. 496–519. ACM Press, Cambridge (1991)CrossRefGoogle Scholar
  2. 2.
    Danvy, O., Malmkjaer, K., Palsberg, J.: Eta-expansion does the trick. Technical Report RS-95-41, University of Aarhus, Aarhus (1995)Google Scholar
  3. 3.
    Friedman, D.P., Want, M., Haynes, C.T.: Essentials of Programming Languages. MIT Press, Cambridge (2003)Google Scholar
  4. 4.
    Hutton, G., Meijer, E.: Monadic Parsing in Haskell. Journal of Functional Programming 8(4), 437–444 (1998)CrossRefzbMATHGoogle Scholar
  5. 5.
    Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000, USA, ftp://cse.ogi.edu/pub/tech-reports/README.html
  6. 6.
    Sabry, A.: The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. PhD thesis, Rice University (August 1994)Google Scholar
  7. 7.
    Taha, W.: Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology (1999) Available from [5]Google Scholar
  8. 8.
    Taha, W.: A gentle introduction to multi-stage programming. In: Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol. 3016, pp. 30–50. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Thiemann, P.: Correctness of a region-based binding-time analysis. In: Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference, Pittsburgh, Pennsylvania, Carnegie Mellon University, p. 26. Elsevier, Amsterdam (1997)Google Scholar
  10. 10.
    Wadler, P., Taha, W., MacQueen, D.B.: How to add laziness to a strict language withouth even being odd. In: Proceedings of the 1998 ACM Workshop on ML, Baltimore, pp. 24–30 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Walid Taha
    • 1
  1. 1.Department of Computer ScienceRice UniversityHoustonUSA

Personalised recommendations