Abstract
Jones optimality is a criterion for assessing the strength of a program specializer. Here, the elements required in a proof of Jones optimality are investigated and the first formal proof for a non-trivial polyvariant specializer (Unmix) is presented. A simplifying element is the use of self-application. Variations of the original criterion are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bjørner, D., Ershov, A.P., Jones, N.D. (eds.): Partial Evaluation and Mixed Computation. North-Holland, Amsterdam (1988)
Danvy, O., Martínez López, P.E.: Tagging, encoding, and jones optimality. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 335–347. Springer, Heidelberg (2003)
Glück, R.: The translation power of the futamura projections. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 133–147. Springer, Heidelberg (2004)
Gomard, C.K., Jones, N.D.: Compiler generation by partial evaluation: a case study. Structured Programming 12(3), 123–144 (1991)
Hughes, J.: Type specialisation for the lambda-calculus; or, a new paradigm for partial evaluation based on type inference. In: Danvy, O., Thiemann, P., Glück, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1110, pp. 183–215. Springer, Heidelberg (1996)
Jones, N.D.: Challenging problems in partial evaluation and mixed computation. In: Bjørner, et al. (eds.) [1], pp. 1–14
Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)
Jones, N.D., Sestoft, P., Søndergaard, H.: Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp and Symbolic Computation 2(1), 9–50 (1989)
Makholm, H.: On jones-optimal specialization for strongly typed languages. In: Taha, W. (ed.) SAIG 2000. LNCS, vol. 1924, pp. 129–148. Springer, Heidelberg (2000)
Mogensen, T.Æ.: Inherited limits. In: Hatcliff, J., Mogensen, T.Æ., Thiemann, P. (eds.) DIKU 1998. LNCS, vol. 1706, pp. 189–202. Springer, Heidelberg (1999)
Romanenko, S.A.: Arity raiser and its use in program specialization. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol. 432, pp. 341–360. Springer, Heidelberg (1990)
Romanenko, S.A.: The specializer Unmix (1990); Program and documentation available from: ftp://ftp.diku.dk/pub/diku/dists/jones-book/Romanenko/
Sestoft, P.: The structure of a self-applicable partial evaluator. In: Ganzinger, H., Jones, N.D. (eds.) Programs as Data Objects. LNCS, vol. 217, pp. 236–256. Springer, Heidelberg (1986)
Sestoft, P.: Automatic call unfolding in a partial evaluator. In: Bjørner, et al. (eds.) [1], pp. 485–506 (1988)
Skalberg, S.C.: Mechanical proof of the optimality of a partial evaluator. Master’s thesis, Department of Computer Science, University of Copenhagen (1999)
Taha, W., Makholm, H., Hughes, J.: Tag elimination and jones-optimality. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol. 2053, pp. 257–275. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gade, J., Glück, R. (2006). On Jones-Optimal Specializers: A Case Study Using Unmix. In: Kobayashi, N. (eds) Programming Languages and Systems. APLAS 2006. Lecture Notes in Computer Science, vol 4279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11924661_25
Download citation
DOI: https://doi.org/10.1007/11924661_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48937-5
Online ISBN: 978-3-540-48938-2
eBook Packages: Computer ScienceComputer Science (R0)