A Foundation for Embedded Languages

ACM Transactions on Programming Languages and Systems

Volumn 25, Issue 3, 2003, Pages 291-315

  Rhiger, Morten ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Completeness; Embedded languages; Haskell; Higher order abstract syntax; Phantom types; Standard ML; Type safety; Type soundness

Indexed keywords

CODE GENERATION; META-LANGUAGES; MONOMORPHIC LANGUAGES;

ABSTRACTING; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; MATHEMATICAL MODELS; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SUBROUTINES;

EMBEDDED SYSTEMS;

EID: 0348162505     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/641909.641910     Document Type: Review

References (47)

1. BARENDREGT, H. 1984. The Lambda Calculus - Its Syntax and Semantics. North-Holland, Amsterdam, The Netherlands.
2. BAWDEN, A. 1999. Quasiquotation in Lisp. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, O. Danvy, Ed. Number NS-99-1 in BRICS Note Series. San Antonio, Texas, 4-12.
3. CARLSON, W. E., HUDAK, P., AND JONES, M. P. 1993. An experiment using Haskell to prototype 'geometric region servers' for navy command and control. Tech. Rep. 1031, Yale University, New Haven, Conn., Nov.
4. CONSTABLE, R. L., ALLEN, S. F., BROMLEY, H. M., CLEAVELAND, W. R., CREMER, J. F., HARPER, R. W., HOWE, D. J., KNOBLOCK, T. B., MENDLER, N. P., PANANGADEN, P., SASAKI, J. T., AND SMITH, S. F. 1986. Implementing Mathematics with the Nuprl Development System. Prentice-Hall, Englewood Cliffs, N.J.
5. DANVY, O., MALMKJæR, K., AND PALSBERG, J. 1996. Eta-expansion does the trick. ACM Trans. Prog. Lang. Syst. 8, 6, 730-751.
6. DANVY, O. AND RHIGER, M. 2001. A simple take on typed abstract syntax in Haskell-like languages. In Proceedings of the 5th International Symposium on Functional and Logic Programming (Tokyo, Japan), H. Kuchen and K. Ueda, Eds. Lecture Notes in Computer Science, vol. 2024. Springer-Verlag, New York, 343-358. An extended version is available as the technical report BRICS RS-00-34.
7. DANVY, O., ROSE, K. H., AND RHIGER, M. 2001. Normalization by evaluation with typed abstract syntax. J. Funct. Prog. 11, 6, 673-680. An extended version is available as the technical report BRICS RS-01-16.
8. DAVIES, R. 1996. A temporal-logic approach to binding-time analysis. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (New Brunswick, N.J.), E. M. Clarke, Ed. IEEE Computer Society Press, Los Alamitos, Calif., 184-195.
9. DE BRUIJN, N. G. 1972. Lambda calculus notation with nameless dummies. A tool for automatic formula manipulation with application to the Church-Rosser theorem. Ind. Math. 34, 381-392.
10. DESPEYROUX, J., PFENNING, F., AND SCHÜRMANN, C. 1997. Primitive recursion for higher-order abstract syntax. In Proceedings of the 3rd International Conference on Typed Lambda Calculi and Applications (Nancy, France), P. de Groote and J. R. Hindley, Eds. Lecture Notes in Computer Science., vol. 1210. Springer-Verlag, New York, 147-163.
11. DOWEK, G., FELTY, A., HERBELIN, H., HUET, G., MURTHY, C., PARENT, C., PAULIN-MOHRING, C., AND WERNER, B. 1993. The COQ proof assistant user's guide. Tech. Rep. 154, INRIA, Rocquencourt, France.
12. ELLIOTT, C. 1997. Modeling interactive 3D and multimedia animation with an embedded language. In Proceedings of the 1st Conference on Domain-Specific Languages (Santa Barbara, Calif.). C. Ramming, Ed. 285-296.
13. ELLIOTT, C., FINNE, S., AND DE MOOR, O. 2000. Compiling embedded languages. In Proceedings of the International Workshop on Semantics, Applications, and Implementation of Program Generation (Montreal, Que., Canada), W. Taha, Ed. Lecture Notes in Computer Science, vol. 1924. Springer-Verlag, New York, 9-27.
14. FASEL, J. H., HUDAK, P., PEYTON JONES, S., AND WADLER, P. 1992. Haskell special issue. SIGPLAN Not. 27, 5 (May).
15. FILINSKI, A. 1999. A semantic account of type-directed partial evaluation. In Proceedings of the International Conference on Principles and Practice of Declarative Programming (Paris, France), G. Nadathur, Ed. Lecture Notes in Computer Science, vol. 1702, Springer-Verlag, New York, 378-395.
16. FINNE, S., LEIJEN, D., MEIJER, E., AND PEYTON JONES, S. 1999. Calling hell from heaven and heaven from hell. In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming (Paris, France). P. Lee, Ed. ACM, New York, 114-125.
17. GORDON, M. J. C. AND MELHAM, T. 1993. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press.
18. HARPER, R., HONSELL, F., AND PLOTKIN, G. 1993. A framework for defining logics. 40, 1, 143-184. A preliminary version appeared in the Proceedings of the 1st IEEE Symposium on Logic in Computer Science (June 1987). IEEE Computer Society Press, Los Alamitos, Calif., 194-204.
19. HICKEY, J. 1997. Nuprl-light: An implementation framework for higher-order logics. In Proceedings of the 14th International Conference on Automated Deduction, W. McCune, Ed. Lecture Notes in Artificial Intelligence, vol. 1249. Springer-Verlag, New York, 395-399.
20. HICKEY, J. 1998-2002. Metaprl homepage. http://metaprl.org.
21. HOFMANN, M. 1999. Semantical analysis of higher-order abstract syntax. In Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (Trento, Italy), G. Longo, Ed. IEEE Computer Society Press, Los Alamitos, Calif.
22. HUDAK, P. 1998. Modular domain specific languages and tools. In Proceedings of the 5th International Conference on Software Reuse (Victoria, B.C., Canada), P. Devanbu and J. Poulin, Eds. IEEE Computer Society Press, Los Alamitos, Calif., 134-142.
23. HUDAK, P., MAKUCEVICH, T., GADDE, S., AND WHONG, B. 1996. Haskore music notation - An algebra of music. J. Funct. Prog. 6, 3, 465-483.
24. JONES, S. P., MEIJER, E., AND LEIJEN, D. 1998. Scripting COM components in Haskell. In Proceedings of the 5th International Conference on Software Reuse (Victoria, B.C., Canada), P. Devanbu and J. Poulin, Eds. IEEE Computer Society Press, Los Alamitos, Calif., 224-233.
25. LANDIN, P. J. 1966. The next 700 programming languages. Commun. ACM 9, 3, 157-166.
26. LEIJEN, D. AND MEIJER, E. 1999. Domain specific embedded compilers. In Proceedings of the 2nd USENIX Conference on Domain-Specific Languages, T. Ball, Ed. 109-122.
27. MEYER, A. R. AND WAND, M. 1985. Continuation semantics in typed lambda-calculi (summary). In Logics of Programs - Proceedings (Brooklyn, N.Y.), R. Parikh, Ed. Lecture Notes in Computer Science, vol. 193. Springer-Verlag, New York, 219-224.
28. MILNER, R., TOFTE, M., HARPER, R., AND MACQUEEN, D. 1997. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Mass.
29. MITCHELL, J. C. 1990. Type systems for programming languages. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, J. van Leeuwen, Ed. The MIT Press, Cambridge, Mass., Chapt. 8, 365-458.
30. NORDSTRÖM, B., PETERSSON, K., AND SMITH, J. 1990. Programming in Martin-Löf's Type Theory. International Series on Monographs on Computer Science No. 7. Oxford University Press.
31. PAULSON, L. C. 1994. Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science, vol. 828. Springer-Verlag, New York.
32. PETERSON, J., HUDAK, P., AND ELLIOTT, C. 1999. Lambda in motion: Controlling robots with Haskell. In Proceedings of the 1st International Symposium on Practical Aspects of Declarative Languages (San Antonio, Tex.), G. Gupta, Ed. Lecture Notes in Computer Science, vol. 1551. Springer-Verlag, New York. 91-105.
33. PFENNING, F. 1991. Logic programming in the LF logical framework. In Logical Frameworks, G. Huet and G. Plotkin, Eds. Cambridge University Press, Cambridge, Mass., 149-181.
34. PFENNING, F. AND ELLIOTT, C. 1988. Higher-order abstract syntax. In Proceedings of the ACM SIGPLAN'88 Conference on Programming Languages Design and Implementation (Atlanta, Ga.), M. D. Schwartz, Ed. SIGPLAN Not., 23, 7. ACM New York, 199-208.
35. PFENNING, F. AND SCHÜRMANN, C. 1999. System description: Twelf - A meta-logical framework for deductive systems. In Proceedings of the 16th International Conference on Automated Deduction (CADE-16) (Trento, Italy), H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, 202-206.
36. REID, A., PETERSON, J., HAGER, G., AND HUDAK, P. 1999. Prototyping real-time vision systems: An experiment in DSL design. In Proceedings of the 21st International Conference on Software Engineering (Los Angeles, Calif.). ACM, New York, 484-493.
37. RHIGER, M. 2001. Higher-order program generation. Ph.D. dissertation. BRICS Ph.D. School, University of Aarhus, Aarhus, Denmark.
38. RHIGER, M. 2002. Compiling embedded programs to byte code. In Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages (Portland, Ore.), S. Krishnamurthi and C. Ramakrishnan, Eds. Lecture Notes in Computer Science, vol. 2257. Springer-Verlag, New York, 120-136.
39. SCOTT, D. 1993. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoret. Comput. Sci. 121, 411-440.
40. STEELE JR., G. L. 1999. Growing a language. Higher-Order Symb. Comput. 12, 3 (Oct.), 221-236.
41. STOY, J. E. 1977. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. The MIT Press, Cambridge, Mass.
42. TAHA, W., BENAISSA, Z.-E.-A., AND SHEARD, T. 1998. Multi-stage programming: Axiomatization and type safety. In Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, K. G. Larsen, S. Skyum, and G. Winskel, Eds. Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, New York, 918-929.
43. WAND, M. 1985. Embedding type structure in semantics. In Proceedings of the 12th Annual ACM Symposium on Principles of Programming Languages, M. S. V. Deusen and Z. Galil, Eds. ACM, New York, 1-6.
44. WINSKEL, G. 1993. The Formal Semantics of Programming Languages. Foundation of Computing Series. The MIT Press, Cambridge, Press.
45. YANG, Z. 1998. Encoding types in ML-like languages. In Proceedings of the 1998 ACM SIGPLAN International Conference on Functional Programming (Baltimore, Md.), P. Hudak and C. Queinnec, Eds. ACM, New York, 289-300. Extended version available as the technical report BRICS RS-98-9.
46. YANG, Z. 2001. Language support for program generation: Reasoning, implementation, and applications. Ph.D. dissertation. Computer Science Department, New York University, New York.
47. YELLAND, P. M. 1999. A compositional account of the Java virtual machine. In Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages (San Antonio, Tex.), A. Aiken, Ed. ACM, New York, 57-69.