Program Generation and Components | SpringerLink
Skip to main content
Springer Nature Link
Log in

Program Generation and Components

  • Conference paper
Formal Methods for Components and Objects (FMCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3657))

Included in the following conference series:

  • 407 Accesses

Abstract

The first part of the paper gives a brief overview of meta-programming, in particular program generation, and its use in software development. The second part introduces a basic calculus, related to FreshML, that supports program generation (as described through examples and a translation of MetaML into it) and programming in-the-large (this is demonstrated by a translation of CMS into it).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ariola, Z.M., Blom, S.: Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic 117(1-3), 95–178 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ancona, D., Moggi, E.: A fresh calculus for names management. In: Karsai and Visser [KV04],

    Google Scholar 

  3. Ancona, D., Zucca, E.: A primitive calculus for module systems. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 62–79. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Ancona, D., Zucca, E.: A calculus of module systems. J. Funct. Programming 12(2), 91–132 (2002) (Extended version of [AZ99])

    MATH  MathSciNet  Google Scholar 

  5. Batory, D., Consel, C., Taha, W. (eds.): Generative Programming and Component Engineering. LNCS, vol. 2487. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  6. Cardelli, L.: Program fragments, linking, and modularization. In: Conf. Rec. POPL 1997: 24th ACM Symp. Princ. of Prog. Langs., pp. 266–277 (1997)

    Google Scholar 

  7. Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Reading (2000)

    Google Scholar 

  8. Cardelli, L., Mitchell, J.C.: Operations on records. In: Gunter, C.A., Mitchell, J.C. (eds.) Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, pp. 295–350. MIT Press, Cambridge (1994)

    Google Scholar 

  9. Calcagno, C., Moggi, E., Sheard, T.: Closed types for a safe imperative MetaML. J. Funct. Programming 13(3), 545–571 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Calcagno, C., Moggi, E., Taha, W.: ML-like inference for classifiers. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 79–93. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Calcagno, C., Taha, W., Huang, L., Leroy, X.: Implementing multi-stage languages using ASTs, gensym, and reflection. In: Pfenning, F., Smaragdakis, Y. (eds.) GPCE 2003. LNCS, vol. 2830, pp. 57–76. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Davies, R.: A temporal-logic approach to binding-time analysis. In: The Symposium on Logic in Computer Science (LICS 1996), New Brunswick, pp. 184–195. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

  13. Davies, R., Pfenning, F.: A modal analysis of staged computation. Journal of the ACM 48(3), 555–604 (2001)

    Article  MathSciNet  Google Scholar 

  14. Programming Languages & Systems, 9th European Symp. Programming. LNCS, vol. 1782. Springer, Heidelberg (2000)

    Google Scholar 

  15. Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Proc. 14th Ann. IEEE Symp. Logic in Comput. Sci., July 1999, pp. 214–224 (1999)

    Google Scholar 

  16. Greenfield, J., Short, K.: Software Factories: Assembling Applications with Patterns, Models, Frameworks and Tools. Wiley Publishing Inc, Chichester (2004)

    Google Scholar 

  17. Haack, C., Wells, J.B.: Type error slicing in implicitly typed higher-order languages. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 284–301. Springer, Heidelberg (2003); Superseded by [HW04]

    Chapter  Google Scholar 

  18. Haack, C., Wells, J.B.: Type error slicing in implicitly typed, higher-order languages. Sci. Comput. Programming 50, 189–224 (2004) (Supersedes [HW03])

    Article  MATH  MathSciNet  Google Scholar 

  19. Karsai, G., Visser, E. (eds.) GPCE 2004. LNCS, vol. 3286. Springer, Heidelberg (2004)

    Google Scholar 

  20. Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol. 3016. Springer, Heidelberg (2004)

    Google Scholar 

  21. MetaOCaml: A compiled, type-safe multi-stage programming language (2001), Available online from http://www.cs.rice.edu/~taha/MetaOCaml/

  22. Moggi, E., Fagorzi, S.: A monadic multi-stage metalanguage. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 358–374. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Machkasova, E., Turbak, F.A.: A calculus for link-time compilation. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 260–274. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Nanevski, A.: Meta-programming with names and necessity. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), New York, October 2002. ACM SIGPLAN notices, ACM Press, New York (2002)

    Google Scholar 

  25. Nanevski, A., Pfenning, F.: Staged computations with names and necessity. J. Funct. Programming (to appear)

    Google Scholar 

  26. Pitts, A.M., Gabbay, M.J.: A metalanguage for programming with bound names modulo renaming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 230–255. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  27. Pfenning, F., Smaragdakis, Y. (eds.): GPCE 2003. LNCS, vol. 2830. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  28. Sheard, T.: Accomplishments and research challenges in meta-programming. In: Taha, W. (ed.) SAIG 2001. LNCS, vol. 2196, pp. 2–46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  29. Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programming with binders made simple. In: Proc. 8th Int’l Conf. Functional Programming. ACM Press, New York (2003)

    Google Scholar 

  30. Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. Addison Wesley, Reading (2002)

    Google Scholar 

  31. Taha, W.: Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Inst. of Science and Technology (1999), Available from ftp://cse.ogi.edu/pub/tech-reports/README.html

  32. Taha, W., Nielsen, M.F.: Environment classifiers. In: The Symposium on Principles of Programming Languages (POPL 2003), New Orleans (2003)

    Google Scholar 

  33. Taha, W., Sheard, T.: Multi-stage programming with explicit annotations. In: Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation(PEPM), Amsterdam, pp. 203–217. ACM Press, New York (1997)

    Chapter  Google Scholar 

  34. Wells, J.B.: René Vestergaard. Confluent equational reasoning for linking with first-class primitive modules (long version). A short version is [WV00]. Full paper, 3 appendices of proofs (August 1999)

    Google Scholar 

  35. Wells, J.B., Vestergaard, R.: Equational reasoning for linking with first-class primitive modules. In ESOP 2000 [ESOP00], pp. 412–428. A long version is [WV99]

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISI, Univ. of Genova, v. Dodecaneso 35, 16146, Genova, Italy

    D. Ancona & E. Moggi

Authors
  1. D. Ancona
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Moggi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science, CWI, Kruislaan 413, 1098, Amsterdam, SJ, The Netherlands

    Frank S. de Boer

  2. Leiden Institute of Advanced Computer Science, Leiden University, P.O. Box 9512, 2300, Leiden, RA, The Netherlands

    Marcello M. Bonsangue

  3. Centre Equitation, VERIMAG, 2 Avenue de Vignate, 38610, Grenoble-Gières, France

    Susanne Graf

  4. Institute of Computer Science and Applied Mathematics, Christian-Albrechts University Kiel, Hermann-Rodewald-Straße 3, 24118, Kiel, Germany

    Willem-Paul de Roever

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ancona, D., Moggi, E. (2005). Program Generation and Components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2004. Lecture Notes in Computer Science, vol 3657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561163_10

Download citation

  • DOI: https://doi.org/10.1007/11561163_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29131-2

  • Online ISBN: 978-3-540-31939-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation