AI Expert
Syntactic abstraction in Scheme
Lisp and Symbolic Computation
Growing languages with metamorphic syntax macros
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Template meta-programming for Haskell
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
Semantically-Sensitive Macroprocessing
Semantically-Sensitive Macroprocessing
Extensibility in programming language design
ACM SIGPLAN Notices - Special issue on programming language design
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Extensible Programming for the 21st Century
Queue - Programming Languages
The jastadd extensible java compiler
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Stratego/XT 0.17. A language and toolset for program transformation
Science of Computer Programming
Axiom-Based Transformations: Optimisation and Testing
Electronic Notes in Theoretical Computer Science (ENTCS)
Polyglot: an extensible compiler framework for Java
CC'03 Proceedings of the 12th international conference on Compiler construction
Syntactic Language Extension via an Algebra of Languages and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Language description for front end implementation
Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications
Domain-specific modelling languages with algebraic graph transformations on RDF
SLE'10 Proceedings of the Third international conference on Software language engineering
A framework for families of domain-specific modelling languages
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
Magnolia is an experimental programming language designed to try out novel language features. For a language to be a flexible basis for new constructs and language extensions, it will need a flexible compiler, one where new features can be prototyped with a minimum of effort. This paper proposes a scheme for compilation by transformation, in which the compilation process can be extended by the program being compiled. We achieve this by making a domain-specific transformation language for processing Magnolia programs, and embedding it into Magnolia itself.