A confluent calculus of macro expansion and evaluation
Syntactic abbreviations or macros provide a powerful tool to increase the syntactic expressivity of programming languages. The expansion of these abbreviations can be modeled with substitutions. This paper presents an operational semantics of macro expansion and evaluation where substitutions are ha...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Ētahi atu kaituhi: | |
| Hōputu: | report |
| I whakaputaina: |
1991
|
| Ngā marau: | |
| Urunga tuihono: | http://hdl.handle.net/20.500.12008/3410 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
| Whakarāpopototanga: | Syntactic abbreviations or macros provide a powerful tool to increase the syntactic expressivity of programming languages. The expansion of these abbreviations can be modeled with substitutions. This paper presents an operational semantics of macro expansion and evaluation where substitutions are handled explicity. The semantics is defined in terms of a confluent, simple, and intuitive ser of rewriting rules. The resulting semantics is also a basis for developing correct implementations. |
|---|