Neil D. Jones
- 1.Andersen L.O., Program analysis and specialization for the C programming language. DIKU, Department of Computer Science, University o} Copenhagen. DIKU Report No. 94/19, 1994.Google Scholar
- 2.Baier R., Glück R., Zöchling R., Partial evaluation of numerical programs in Fortran. In: ACM SIGPLAN Workshop on Partial Evaluation and Semantics.Based Program Manipulation. 119-132, Report 94/9, University of Melbourne, Australia 1994.Google Scholar
- 3.L. Beckman et al., 'A partial evaluat,or, and its use as a programming tool', Artificial Intelligence, 7(4):319-357, 1976.Google ScholarCross Ref
- 4.A. Berlin and D. Weise, 'Compiling scientific code using partial evaluation', IEEE Computer, 23(12):25-37, December 1990. Google ScholarDigital Library
- 5.Birkedal L., Welinder, M., Partial Dvaluation of Standard ML. DIKU, Department o} Computer Science, University of Copenhagen. DIKU Report No. 93/22, 1993.Google Scholar
- 6.D. Bj~rner, A.P. Ershov, and N.D. Jones (eds.), Partial Evaluation and Mixed Compultation. Proceedings of the IFIP TC2 Workshop, Gammel A vernaes, Denmark, October 1987, Amsterdam: North-Holland, 1988. Google ScholarDigital Library
- 7.A. Bondorf and O. Danvy, 'Automatic autoprojection of recursive equations with global variables and abstract data types', Science of Computer Programming, 16:151-195, 1991. Google ScholarDigital Library
- 8.C. Consel, 'New insights into partial evaluation: The Schism experiment', in H. Ganzinger (ed.), ESOP '88, 2nd European Symposium on Programming, Nancy, France, March 1988 (Lecture Notes in Computer Science, vol. 300), pp. 236-246, Berlin: Springer-Verlag, 1988. Google ScholarDigital Library
- 9.A. De Niel, E. Bevers, and K. De Vlarainck, 'Partial evaluation of polymorphically typed functional languages: The representation problem', in M. Billaud et al. (eds.), Analyse Statique en Programmation JEquationnelle, Fonctionnelle, et Logique, Bordeaux, France, Octobre 1991 (Bigre, vol. 74), pp. 90-97, Rennes: IRISA, 1991.Google Scholar
- 10.A.P. Ershov: Mixed Computation: Potential applications and problems for study. Theoretical Computer Science 18, pp. 41-67, 1982.Google ScholarCross Ref
- 11.hr. Futamura, 'Partial evaluation of computation process - an approach to a compiler-compiler', Systems, Computers, Controls, 2(5):45-50, 1971.Google Scholar
- 12.Robert Gliick and Andrei V. Klimov, Occam's razor in metacomputation: the notion of a perfect process tree. In Static analysis Proceedings, eds. P. Cousot, M. Falaschi, G. Fil6, G. Rauzy. Lecture Notes in Computer Science 724, pp. 112-123, Springer-Verlag, 1993. Google Scholar
- 13.C. Goad, 'Automatic construction of special purpose programs', in D.W. Loveland (ed.), 6th Conference on Automated Deductzon, New York, USA (Lecture Notes in Computer Science, col. 138), pp. 194-208, Berlin: Springer-Verlag, 1982. Google ScholarDigital Library
- 14.C.K. Gomard and N.D. Jones, 'A partial evaluator for the untyped lambda-calculus', Journal of Functional Programming, 1(1):21-69, January 1991.Google ScholarCross Ref
- 15.C. Gurr, A Self-applicable Partial Evaluator for the Logic Programming Language G6del, Ph.D. thesis, University of Bristol, 1994.Google Scholar
- 16.N.D. Jones (ed.), Semant2cs-Directed Compiler Generation, Aarhus, Denmark, January 1980 (Lecture Notes in Computer Science, col. 9~), Berlin: Springer-Verlag, 1980. Google ScholarDigital Library
- 17.N.D. Jones and D.A. Schmidt, 'Compiler generation from denotational semantics', in N.D. Jones (ed.), Semantics-Directed Compiler Generation, Aarhus, Denmark (Lecture Notes in Computer Science, col. 94), pp. 70-93, Berlin: Springer- Verlag, 1980. Google Scholar
- 18.N.D. Jones, P. Sestoft, and H. SOndergaard, 'An experiment in partial evaluation: The generation of a compiler generator', in J.-P. Jouannaud (ed.), Rewriting Techniques and Applications, Dijon, France. (Lecture Notes zn Computer Science, col. 202), pp. 124-140, Berlin: Springer-Verlag, 1985. Google ScholarDigital Library
- 19.N.D. Jones, 'Automatic program specialization: A re-examination from basic principles', in D. BjOrner, A.P. Ershov, and N.D. Jones (eds.), Partial Evaluation and Mixed Computation, pp. 225-282, Amsterdam: North-Holland, 1988.Google Scholar
- 20.Neil D. Jones, C.K. Gomard, P. Sestoft, "Partial Evaluation and Automatic Program Generation," Prentice Hall International Series in Computer Science, 1993. Google ScholarDigital Library
- 21.Jones, N. D., Constant time factors do matter, ACM Symposium on Theory of Computing, ACM Press, S. Homer (ed.) (1993), 602-611. Google ScholarDigital Library
- 22.N. D. Jones, The Essence of Program Transformation by Partial Evaluation and Driving, in Logic, Language and Computation, a Festschrift in honor of Satoru Takasu, edited by Masahiko Sato N. D. Jones, Masami Hagiya, pages 206-224, S-V, April 1994.Google Scholar
- 23.J. J0rgensen, 'Generating a compiler for a lazy language by partial evaluation', in Nineteenth A CM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, January 1992, pp. 258-268, New York: ACM, 1992. Google ScholarDigital Library
- 24.J. Lemnchbury, ProTection Favtori~ation~ ir~ Partial Evaluation, Cambridge: Cambridge University Press, 1991. Google ScholarDigital Library
- 25.S.A. Romanenko, 'A compiler generator produced by a self-applicable specializer can have a surprisingly natural and understandable structure', in D. Bj0rner, A.P. Ershov, and N.D. Jones (eds.), Partial Evaluation and Mixed Computation, pp. 445-463, Amsterdam: North-Holland, 1988.Google Scholar
- 26.D. Sahfin, 'The Mixtus approach to automatic partial evaluation of full Prolog', in S. Debray and M. Hermenegildo (eds.), Logic Programming: Proceedings of the 1990 North American Conference, Austin, Texas, October 1990, pp. 377-398, Cambridge, MA: MIT Press, 1990. Google ScholarDigital Library
- 27.Morten Heine S0rensen, Robert Glfick and Neil D. Jones, Towards unifying partial evaluation, deforestation, supercompilation, and GPC. European Symposium on Programming (ESOP). Lecture Notes in Computer Science, Springer-Verlag, 1994. Google ScholarDigital Library
- 28.Valentin F. Turchin, The concept of a supercompiler. A CM Transactions on Programming Languages and Systems, 8(3), pp. 292-325, July 1986. Google ScholarDigital Library
- 29.M. Tofte, Compiler Generators. What They Can Do, What They Might Do, and What They Will Probably Never Do, volume 19 of EATCS Monographs on Theoretical Computer Science, Berlin: Springer-Verlag, 1990. Earlier version: DIKU Report 84/8, DIKU, University of Copenhagen, Denmark, 1984. Google ScholarDigital Library
- 30.Philip L. Wadler, Deforestation: transforming programs to eliminate trees. European Symposium On Programming (ESOP). Lecture Notes in Computer Science 300, pp. 344-358, Nancy, France, Springer- Verlag, 1988. Google ScholarDigital Library
Index Terms
- Mix ten years later
Recommendations
Ten Commandments of Formal Methods ...Ten Years Later
How have the formal methods commandments fared over the past decade? Are they still valid in the current industrial setting, and have attitudes toward formal methods improved? The authors revisit their ten maxims to answer these questions.
Ten commandments ten years on: lessons for ASM, B, Z and VSR-net
Rigorous Methods for Software Construction and AnalysisJust over a decade ago, a paper Ten Commandments of Formal Methods [16] suggested some guidelines to help ensure the success of a formal methods project. It proposed ten important requirements (or “commandments”) for formal developers to consider and ...
Ten years on internet time
Trusted computing: who will control the PC of the future?When did you start using the Internet? Ten years ago, in 1996, there were about 40 million people in the US and Canada with online access. The number worldwide was less than twice that. Today, over one billion people are estimated to be on the Internet.
...
Comments