Tag Elimination and Jones-Optimality-Reference-Cited by-同舟云学术

Tag Elimination and Jones-Optimality

Published:2001 Issue: Volume: Page:257-275
ISSN:0302-9743
Container-title:Programs as Data Objects
language:
Short-container-title:

Author:

Taha Walid,Makholm Henning,Hughes John

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44978-7_15

Reference19 articles.

1. Lect Notes Comput Sci;O. Danvy,1998

2. Fritz Henglein and Jakob Rehof. Safe polymorphic type inference for a dynamically typed language: Translating Scheme to ML. In Proceedings of the International Conference on Functional Programming Languages and Computer Architecture (FPCA), La Jolla, 1995. ACM Press.

3. John Hughes. Type specialization. ACM Computing Surveys, 30(3es), 1998.

4. John Hughes. The correctness of type specialisation. In European Symposium on Programming (ESOP), 2000.

5. Neil D. Jones. Challenging problems in partial evaluation and mixed computation. In D. Bjørner, A. P. Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation, pages 1–14, North-Holland, 1988. IFIP World Congress Proceedings, Elsevier Science Publishers B.V.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Jones-optimal partial evaluation by specialization-safe normalization;Proceedings of the ACM on Programming Languages;2018-01

2. An investigation of Jones optimality and BTI-universal specializers;Higher-Order and Symbolic Computation;2008-09

3. Gradual Typing for Objects;ECOOP 2007 – Object-Oriented Programming;2007

4. On Jones-Optimal Specializers: A Case Study Using Unmix;Programming Languages and Systems;2006

5. Specialising Interpreters Using Offline Partial Deduction;Program Development in Computational Logic;2004