PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
The next 700 formal language descriptions
Lisp and Symbolic Computation - Special issue on continuations—part I
Optimizing ML with run-time code generation
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
C: a language for high-level, efficient, and machine-independent dynamic code generation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A general approach for run-time specialization and its application to C
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modal analysis of staged computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two for the price of one: composing partial evaluation and compilation
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Calling hell from heaven and heaven from hell
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2nd conference on Domain-specific languages
2nd Conference on Domain-Specific Languages
Domain specific embedded compilers
Proceedings of the 2nd conference on Domain-specific languages
The next 700 programming languages
Communications of the ACM
The Definition of Standard ML
Partial Evaluation of Computation Process—AnApproach to a Compiler-Compiler
Higher-Order and Symbolic Computation
Type-Directed Partial Evaluation
Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School
SAIG '00 Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation
Fast Tactic-Based Theorem Proving
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation
TIC '98 Proceedings of the Second International Workshop on Types in Compilation
Nuprl-Light: An Implementation Framework for Higher-Order Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A temporal-logic approach to binding-time analysis
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Scripting COM Components in Haskell
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Modular Domain Specific Languages and Tools
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Combinators for program generation
Journal of Functional Programming
Journal of Functional Programming
A foundation for embedded languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Functional languages have proven substantially useful for hosting embedded domain-specific languages. They provide an infrastructure rich enough to define both a convenient syntax for the embedded language, a type system for embedded programs, and an evaluation mechanism for embedded programs. However, all existing host languages either interpret embedded programs instead of compiling them or require an expensive pre-compilation phase. In this article we close this gap in an implementation of the functional language OCaml: We provide a library of OCamlb yte-code combinators that is reminiscent of quasi-quotation in Lisp and of 'C and that enables just-in-time compilation of embedded programs. We illustrate these byte-code combinators on a prototypical domain-specific language.