Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2001, Pages 74-85

  Ganz, S E ^a   Sabry, A ^a   Taha, W ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; DATA STRUCTURES; EQUIVALENCE CLASSES; HIGH LEVEL LANGUAGES; SEMANTICS;

MULTI-STAGE COMPUTATIONS; MULTI-STAGE PROGRAMMING LANGUAGE;

MACROS;

EID: 0034782593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (51)

1. Correctness of monadic state: An imperative call-by-need calculus
2. Logical modalities and multi-stage programming
3. Closed types as a simple approach to safe imperative multi-stage programming
4. Extensible grammars for language specialization
5. A temporal-logic approach to binding-time analysis
6. A modal analysis of staged computation
7. Syntactic abstraction in scheme
8. Recursive monadic bindings
9. On the expressive power of programming languages
10. Abstract syntax and variable binding
11. Efficient multi-level generating extensions for program specialization
12. Fast binding-time analysis for multi-level specialization
13. An automatic program generator for multi-level specialization
14. A partial evaluator for untyped lambda calculus
15. Notational definitions - A formal account
16. A typed context calculus
17. Semantical analysis of higher-order abstract syntax
18. Hygienic macro expansion
19. Implicit parameters: Dynamic scoping with static types
20. Computing with contexts
21. An extension to ML to handle bound variables in data structures: Preliminary report
22. On abstraction and the expressive power of programming languages
23. Notions of computation and monads
24. A categorical account of two-level languages
25. Functor categories and two-level languages
26. An idealized metaML: Simpler, and more expressive
27. Inlining as staged computation
28. Improvement in a lazy context: An operational theory for call-by-need
29. Two-level semantics and code generation
30. Purely functional data structures
31. The VLISP verified prescheme compiler
32. DALI: An untyped, CBV functional language supporting first-order datatypes with binders (technical development)
33. Higher-order abstract syntax
34. A metalanguage for programming with bound names modulo renaming
35. Call-by-name, call-by-value and the lambda-calculus
36. What is a purely functional language?
37. Computing with contexts: A simple approach
38. Using metaML: A staged programming language
39. Dynamic typing through staged type inference
40. Multi-stage programming: Its theory and applications
41. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial
42. Multi-stage programming: Axiomatization and type-safety
43. Tag elimination - or - Type specialisation is a type-indexed effect
44. Multi-stage programming with explicit annotations
45. Partial evaluation for higher-order languages with state
46. Embedding type structure in semantics
47. The theory of fexprs is trivial