Syntactic abstraction in component interfaces

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

Volumn 3676 LNCS, Issue , 2005, Pages 373-388

  Culpepper, Ryan ^a   Owens, Scott ^b   Flatt, Matthew ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILATION; MACRO SYSTEM; SYNTACTIC ABSTRACTION;

ABSTRACTING; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PROGRAM COMPILERS; SYNTACTICS;

INTERFACES (COMPUTER);

EID: 33646154450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561347_25     Document Type: Conference Paper

References (23)

1. Wirth, N.: Programming in MODULA-2 (3rd corrected ed.). Springer-Verlag New York, Inc., New York, NY, USA (1985)
2. Szyperski, C.: Component Software. Addison-Wesley (1998)
3. MacQueen, D.: Modules for standard ml. In: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming. (1984) 198-207
4. Leroy, X.: Manifest types, modules, and separate compilation. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (1994) 109-122
5. Kelsey, R., Rees, J., Sperber, M.: Scheme48 Reference Manual. 1.1 edn. (2005) http://s48.org/1.1/manual/s48manual.html.
6. Flatt, M., Felleisen, M.: Units: Cool modules for HOT languages. In: ACM SIGPLAN Conference on Programming Language Design and Implementation. (1998) 236-248
7. 5 report of the algorithmic language Scheme. ACM SIGPLAN Notices 33 (1998) 26-76
8. Dybvig, R.K., Hieb, R., Bruggeman, C.: Syntactic abstraction in Scheme. Lisp and Symbolic Computation 5 (1993) 295-326
9. Queinnec, C.: Modules in scheme. In: Proceedings of the Third Workshop on Scheme and Functional Programming. (2002) 89-95
10. Serrano, M.: Bigloo: A "practical Scheme compiler". 2.7a edn. (2005) http://www.sop.inria.fr/mimosa/fp/Bigloo/doc/bigloo.html.
11. Waddell, O., Dybvig, R.K.: Extending the scope of syntactic abstraction. In: Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas, New York, NY (1999) 203-213
12. Flatt, M.: Composable and compilable macros: You want it when? In: ACM SIGPLAN International Conference on Functional Programming. (2002)
13. Kohlbecker, E.E., Friedman, D.P., Felleisen, M., Duba, B.F.: Hygienic macro expansion. In: ACM Symposium on Lisp and Functional Programming. (1986) 151-161
14. Clinger, W., Rees, J.: Macros that work. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (1991) 155-162
15. Findler, R.B., Clements, J., Flanagan, C., Flatt, M., Krishnamurthi, S., Steckler, P., Felleisen, M.: DrScheme: A programming environment for Scheme. Journal of Functional Programming 12 (2002) 159-182
16. A preliminary version of this paper appeared in PLILP 1997, LNCS volume 1292, pp. 369-388.
17. Bawden, A.: First-class macros have types. In: Proc. symposium on Principles of programming languages, ACM Press (2000) 133-141
18. Krishnamurthi, S.: Linguistic Reuse. PhD thesis, Rice University (2001)
19. Ganz, S.E., Sabry, A., Taha, W.: Macros as multi-stage computations: Type-safe, generative, binding macros in macroml. In: International Conference on Functional Programming. (2001) 74-85
20. Taha, W., Johann, P.: Staged notational definitions. In: Proceedings of the second international conference on Generative programming and component engineering. (2003) 97-116
21. Harper, R., Lillibridge, M.: A type-theoretic approach to higher-order modules with sharing. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (1994) 123-137
22. Harper, R., Pierce, B.C.: Design issues in advanced module systems. In Pierce, B.C., ed.: Advanced Topics in Types and Programming Languages. MIT Press (2004) To appear.
23. McDirmid, S., Flatt, M., Hsieh, W.C.: Jiazzi: New-age components for old-fashioned Java. In: Proc. conference on Object oriented programming, systems, languages, and applications, ACM Press (2001) 211-222