A verified staged interpreter is a verified compiler

Proceedings of the 5th International Conference on Generative Programming and Component Engineering, GPCE'06

Volumn , Issue , 2006, Pages 111-120

  Brady, Edwin ^a   Hammond, Kevin ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Dependent types; Domain specific language implementation; Functional programming; Multi stage programming; Partial evaluation; Resource aware programming

Indexed keywords

COMPUTER AIDED DESIGN; EMBEDDED SYSTEMS; FUNCTIONAL PROGRAMMING; MULTI AGENT SYSTEMS; PROGRAM COMPILERS; REAL TIME SYSTEMS; RESOURCE ALLOCATION;

DEPENDENT TYPES; DOMAIN SPECIFIC LANGUAGE IMPLEMENTATION; MULTI-STAGE PROGRAMMING; PARTIAL EVALUATION; RESOURCE AWARE PROGRAMMING;

PROGRAM INTERPRETERS;

EID: 34547487371     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1173706.1173724     Document Type: Conference Paper

References (37)

1. T. Altenkirch. Stop thinking about bottoms when writing programs, 2006. Talk at BCTCS 2006.
2. T. Altenkirch, C. McBride, and J. McKinna. Why dependent types matter. http://www.cs.nott.ac.uk/~txa/publ/ydtm.pdf, 2005. Draft.
3. L. Augustsson. Cayenne - a language with dependent types. In Proc. 1998 International Conf. on Functional Programming (ICFP '98), pages 239-250, 1998.
4. L. Augustsson and M. Carlsson. An exercise in dependent types: A well-typed interpreter. http://www.cs.chalmers.se/~augustss/cayenne/, 1999.
5. U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed λ-calculus. In R. Vemuri, editor, Proc. 1991 IEEE Symp. on Logic in Comp. Sci., pages 203-211, 1991.
6. E. Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
7. E. Brady and K. Hammond. A dependently typed framework for static analysis of program execution costs. In Proc. Implementation of Functional Languages (IFL 2005). Springer, 2006.
8. L. Cardelli. Phase distinctions in type theory. Manuscript, 1988.
9. Coq Development Team. The Coq proof assistant -reference manual. http://coq.inria.fr/, 2001.
10. H. B. Curry and R. Feys. Combinatory Logic, volume I. North Holland, 1958.
11. K. Czarnecki, J. O'Donnell, J. Striegnitz, and W Taha. DSL implementation in MetaOCaml, Template Haskell, and C++. In Domain Specific Program Genearation 2004, volume 3016 of LNCS. Springer, 2004.
12. P. Dybjer. Inductive families. Formal Aspects of Computing, 6(4):440-465, 1994.
13. J. Eckhardt, R. Kaibachev, E. Pašalíc, K. Swadi, and W. Taha. Implicitly heterogeneous multi-stage programming. In Proc. 2005 Conf. on Generative Programming and Component Engineering (GPCE 2005), volume 3676 of LNCS. Springer, 2005.
14. Y. Futamura. Partial evaluation of computation process - an approach to a compiler-compiler. Higher-Order and Symbolic Computation, 12(4), 1999.
15. Reprinted from Systems Computers Controls 2(5), 1971.
16. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In Proc. 2002 International Conf. on Functional Programming (ICFP 2002), pages 235-246, 2002.
17. K. Hammond and G. Michaelson. Hume: a Domain-Specific Language for Real-Time Embedded Systems. In Proc. Conf. Generative Programming and Component Engineering (GPCE'03), Lecture Notes in Computer Science. Springer-Verlag, 2003.
18. R. Harper and R. Pollack. Type checking with universes. Theoretical Computer Science, 89(1): 107-136, 1991.
19. W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B.Curry: Essays on combinatory logic, lambda calculus and formalism. Academic Press, 1980. A reprint of an unpublished manuscript from 1969.
20. G. Hutton and J. Wright. Compiling exceptions correctly. In Mathematics of Program Construction, volume 3125 of LNCS. Springer, 2004.
21. O. Kiselyov, K. Swahi, and W. Taha. A methodology for generating verified combinatorial circuits. In Fourh International Conference on Embedded Software, pages 249-258. ACM, 2004.
22. X. Leroy. Formal certification of a compiler back-end. In Principles of Programming Languages 2006, pages 42-54. ACM Press, 2006.
23. Z. Luo. Computation and Reasoning - A Type Theory for Computer-Science. Intl. Series of Monographs on Comp. Sci. OUP, 1994.
24. C. McBride. Dependently Typed Functional Programs and their proofs. PhD thesis, University of Edinburgh, May 2000.
25. C. McBride. Epigram: Practical programming with dependent types. Lecture Notes, International Summer School on Advanced Functional Programming, 2004.
26. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004.
27. J. McKinna. Why dependent types matter. In Proc. ACM Symp. on Principles of Programming Languages (POPL 2006), pages 1-1, 2006.
28. J. McKinna and J. Wright. A type-correct, stack-safe, provably correct expression compiler in Epigram. Journal of Functional Programming, 2006. To appear.
29. MetaOCaml: A compiled, type-safe multi-stage programming language. Available online from http://www.cs.rice.edu/ ~taha/MetaOCaml/, 2001.
30. E. Pašalíc. The Role of Type-Equality in Meta-programming. PhD thesis, OGI School of Science and Engineering, 2004.
31. E. Pašalíc, W. Taha, and T. Sheard. Tagless staged interpreters for typed languages. In Proc. 2002 International Conf. on Functional Programming (ICFP 2002). ACM, 2002.
32. T. Sheard and S. Peyton-Jones. Template meta-programming for haskell. In Proc. 2002 ACM Haskell workshop, pages 1-16, 2002.
33. W. Taha. Multi-stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Inst. of Science and Technology, 1999.
34. W. Taha. A gentle introduction to multi-stage programming, 2003. Available from http://www.cs.rice.edu/~taha/publications/journal/dspg04a.pdf.
35. W. Taha, S. Ellner, and H. Xi. Generating heap-bounded programs in a functional setting. In Third International Conference on Embedded Software, volume 2855 of LNCS. Springer, 2003.
36. W. Taha and M. F. Nielsen. Environment classifiers. In Proc. ACM Symp. on Principles of Programming Languages (POPL 2003), pages 26-37, 2003.
37. T. Uustalu. Partiality is an effect, 2004. Talk at Dagstuhl workshop on Dependently Typed Progamming.