Slide 62
Slide 62 text
ࢀߟจݙ
• [1] Jacques Carette, Oleg Kiselyov, and Chung-chieh Shan. 2009. Finally tagless, partially evaluated: Tagless
staged interpreters for simpler typed languages. J. Funct. Program. 19, 5 (September 2009), 509-543.
• [2] Miller, Dale & Nadathur, Gopalan (1987) A logic programming approach to manipulating formulas and
programs. In IEEE Symposium on Logic Programming, Seif Haridi (ed). Washington, DC: IEEE Comp. Society
Press, pp. 379–388.
• [3] Pfenning, Frank & Elliott, Conal (1988) Higher-order abstract syntax. In PLDI 88: Proceedings of the ACM
Conference on Programming Language Design and Implementation. ACM SIGPLAN Notices, vol. 23(7).
New York: ACM, pp. 199–208.
• [4] Kenichi Suzuki, Oleg Kiselyov, and Yukiyoshi Kameyama. 2016. Finally, safely-extensible and efficient
language-integrated query. PEPM '16. ACM, New York, NY, USA, 37-48.
• [5] Per Martin-Löf. About models for intuitionistic type theories and the notion of definitional equality. In
Proceedings of the Third Scandinavian Logic Symposium (1972), volume 82 of Studies in Logic and the
Foundation of Mathematics, pages 81–109. North-Holland, 1975.
• [6] Olivier Danvy and Andrzej Filinski. Abstracting control. In Mitchell Wand, editor, Proceedings of the 1990
ACM Conference on Lisp and Functional Programming, pages 151–160, Nice, France, June 1990. ACM Press
• [7] Peter Dybjer and Andrzej Filinski. Normalization and partial evaluation. In Gilles Barthe, Peter Dybjer,
Luís Pinto, and João Saraiva, editors, Applied Semantics – Advanced Lectures, number 2395 in Lecture
Notes in Computer Science, pages 137–192, Caminha, Portugal, September 2000. Springer-Verlag.