Anders Bondorf (1992):
Improving Binding Times Without Explicit CPS-Conversion.
In: Lisp & Functional Programming,
pp. 1–10,
doi:10.1145/141471.141483.
Matt Brown & Jens Palsberg (2016):
Breaking through the normalization barrier: a self-interpreter for f-omega.
In: Rastislav Bodik & Rupak Majumdar: POPL '16: Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
ACM Press,
New York,
pp. 5–17,
doi:10.1145/2914770.2837623.
Cristiano Calcagno, Eugenio Moggi & Walid Taha (2004):
ML-Like Inference for Classifiers.
In: ESOP,
LNCS 2986,
pp. 79–93,
doi:10.1007/978-3-540-24725-8_7.
Luca Cardelli (1987):
Basic Polymorphic Typechecking.
Science of Computer Programming 8(2),
pp. 147–172,
doi:10.1016/0167-6423(87)90019-0.
Chiyan Chen & Hongwei Xi (2005):
Meta-Programming Through Typeful Code Representation.
Journal of Functional Programming 15(6),
pp. 797–835,
doi:10.1017/S0956796805005617.
Wontae Choi, Baris Aktemur, Kwangkeun Yi & Makoto Tatsuta (2011):
Static Analysis of Multi-staged Programs via Unstaging Translation.
In: Thomas Ball & Mooly Sagiv: POPL '11: Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
ACM Press,
New York,
pp. 81–92,
doi:10.1145/1925844.1926397.
Jacques Garrigue (2004):
Relaxing the Value Restriction.
In: FLOPS,
LNCS 2998.
Springer-Verlag,
Berlin,
pp. 196–213,
doi:10.1007/978-3-540-24754-8_15.
Yukiyoshi Kameyama, Oleg Kiselyov & Chung-chieh Shan (2008):
Closing the Stage: From Staged Code to Typed Closures.
In: PEPM,
pp. 147–157,
doi:10.1145/1328408.1328430.
Yukiyoshi Kameyama, Oleg Kiselyov & Chung-chieh Shan (2011):
Shifting the Stage: Staging with Delimited Control.
Journal of Functional Programming 21(6),
pp. 617–662,
doi:10.1017/S0956796811000256.
Yukiyoshi Kameyama, Oleg Kiselyov & Chung-chieh Shan (2015):
Combinators for impure yet hygienic code generation.
Science of Computer Programming 112 (part 2),
pp. 120–144,
doi:10.1016/j.scico.2015.08.007.
Oleg Kiselyov (2012):
Delimited control in OCaml, abstractly and concretely.
Theor. Comp. Sci. 435,
pp. 56–76,
doi:10.1016/j.tcs.2012.02.025.
Oleg Kiselyov (2013):
MetaOCaml Lives On: Lessons from implementing a staged dialect of a functional language.
ACM SIGPLAN Workshop on ML.
Oleg Kiselyov (2014):
The Design and Implementation of BER MetaOCaml - System Description.
In: FLOPS,
LNCS 8475.
Springer,
pp. 86–102,
doi:10.1007/978-3-319-07151-0_6.
Megumi Kobayashi & Atsushi Igarashi (2015):
Polymorphic type system for the multi-stage calculus with references.
32. Meeting of Japan Society for Software Science and Technology (in Japanese).
Peter J. Landin (1966):
The Next 700 Programming Languages.
Communications of the ACM 9(3),
pp. 157–166,
doi:10.1145/365230.365257.
Julia L. Lawall & Olivier Danvy (1994):
Continuation-Based Partial Evaluation.
In: Lisp & Functional Programming,
pp. 227–238,
doi:10.1145/182409.182483.
Xavier Leroy (1993):
Polymorphism by name for references and continuations.
In: POPL '93: Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
ACM Press,
New York,
pp. 220–231,
doi:10.1145/158511.158632.
Donald Michie (1968):
``Memo'' Functions and Machine Learning.
Nature 218,
pp. 19–22,
doi:10.1038/218019a0.
(2003):
POPL '03: Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
Tiark Rompf, Nada Amin, Adriaan Moors, Philipp Haller & Martin Odersky (2013):
Scala-Virtualized: linguistic reuse for deep embeddings.
Higher-Order and Symbolic Computation September,
doi:10.1007/s10990-013-9096-9.
Tim Sheard & Simon L. Peyton Jones (2002):
Template Meta-programming for Haskell.
In: Manuel M. T. Chakravarty: Haskell Workshop,
pp. 1–16,
doi:10.1145/581690.581693.
Walid Taha & Michael Florentin Nielsen (2003):
Environment Classifiers,
pp. 26–37,
doi:10.1145/640128.604134.
Peter Thiemann (1999):
Combinators for Program Generation.
Journal of Functional Programming 9(5),
pp. 483–525,
doi:10.1017/S0956796899003469.
Mads Tofte (1987):
Operational Semantics and Polymorphic Type Inference.
Edinburgh University.
Laboratory for Foundations of Computer Science Technical Report ECS-LFCS-88-54.
Andrew K. Wright (1995):
Simple Imperative Polymorphism.
Lisp and Symbolic Computation 8(4),
pp. 343–355,
doi:10.1007/BF01018828.
Hongwei Xi, Chiyan Chen & Gang Chen (2003):
Guarded Recursive Datatype Constructors,
pp. 224–235,
doi:10.1145/640128.604150.