Closed types for a safe imperative MetaML

Journal of Functional Programming

Volumn 13, Issue 3, 2003, Pages 545-571

  Calcagno, C ^a   Moggi, E ^a   Sheard, T ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORE LANGUAGES;

CODES (SYMBOLS); CODING ERRORS; COMPUTER PROGRAMMING LANGUAGES;

AUTOMATIC PROGRAMMING;

EID: 0038528229     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004598     Document Type: Article

References (29)

1. Benaissa, Z. El-A., Moggi, E., Taha, W. and Sheard, T. (1999) Logical modalities and multi-stage programming. Federated Logic Conference (FLoC) Satellite Workshop on Intuitionistic Modal Logics and Applications (IMLA).
2. Calcagno, C. and Moggi, E. (2000) Multi-stage imperative languages: A conservative extension result. In: Taha, W., editor, Semantics, Applications, and Implementation of Program Generation: Lecture Notes in Computer Science 1924, pp. 92-107. Springer-Verlag.
3. Calcagno, C., Moggi, E. and Taha, W. (2000) Closed types as a simple approach to safe imperative multi-stage programming. International Colloquium on Automata, Languages, and Programming (ICALP '00): Lecture Notes in Computer Science 1853, pp. 25-36. Springer-Verlag.
4. Cardelli, L. (1997) Type systems. In: Tucker, A. B. Jr., editor. The Computer Science and Engineering Handbook. CRC Press.
5. Clement, D., Despeyroux, J., Despeyroux, T. and Kahn, G. (1986) A simple applicative language: Mini-ML. Proceedings ACM Conference on Lisp and Functional Programming, pp. 13-27. ACM press.
6. Davies, R. (1996) A temporal-logic approach to binding-time analysis. Symposium on Logic in Computer Science (LICS '96). pp. 184-195. IEEE Press.
7. Davies, R. and Pfenning, F. (1996) A modal analysis of staged computation. Symposium on Principles of Programming Languages (POPL '96), pp. 258-270.
8. Glück, R. and Jørgensen, J. (1996) Fast binding-time analysis for multi-level specialization. In: Bjørner, D.. Broy, M. and Pottosin. I., editors, Perspectives of System Informatics: Lecture Notes in Computer Science 1181, pp. 261-272. Springer-Verlag.
9. Gomard, C. K. and Jones, N. D. (1991) A partial evaluator for untyped lambda calculus. J. Functional Program. 1(1). 21 -69.
10. Harper, R. and Stone, C. (1997) A type-theoretic account of Standard ML 1996 (version 2). Technical report CMU-CS-97-147, Carnegie Mellon University, Pittsburgh, PA.
11. Hatcliff, J. and Danvy, O. (1997) A computational formalization for partial evaluation. Math. Struct. Comput. Sci. 7(5), 507-541.
12. Jones, N. D., Gomard, C. K. and Sestoft, P. (1993) Partial Evaluation and Automatic Program Generation. Prentice-Hall.
13. Kamin, S., Callahan, M. and Clausen, L. (2000) Lightweight and generative components II: Binary-level components. In: Taha, W., editor, Semantics, Applications, and Implementation of Program Generation: Lecture Notes in Computer Science 1924, pp. 28-50. Springer-Verlag.
14. MHP (2000) The MetaML Home Page. Provides source code and documentation online at http://www.cse.ogi.edu/PacSoft/projects/metaml/index.html.
15. Milner, R. (1978) A theory of type polymorphism in programming. J. Comput. & Syst. Sci. 17, 348-375.
16. Milner R., Tofte, M., Harper, R. and MacQueen, D. (1997) The Definition of Standard ML (revised). MIT Press.
17. Moggi, E. (1998) Functor categories and two-level languages. Foundations of Software Science and Computation Structures (FoSSaCS): Lecture Notes in Computer Science 1378. Springer-Verlag.
18. Moggi, E., Taha, W., Benaissa, Z. El-A. and Sheard, T. (1999) An idealized MetaML: Simpler, and more expressive. European Symposium on Programming (ESOP): Lecture Notes in Computer Science 1576, pp. 193-207. Springer-Verlag.
19. Smith, B. C. (1982) Reflection and semantics in a procedural language. PhD thesis. Massachusetts Institute of Technology.
20. Taha, W. (1999) Multi-stage programming: Its theory and applications. PhD thesis. Oregon Graduate Institute of Science and Technology. (Available from ftp://cse.ogi.edu/pub/tech-reports/README.html.)
21. Taha, W. (ed) (2000a) Semantics, Applications, and Implementation of Program Generation: Lecture Notes in Computer Science 1924. Springer-Verlag.
22. Taha, Wa. (2000b) A sound reduction semantics for untyped CBN multi-stage computation. Or. the theory of MetaML is non-trivial. Proceedings Workshop on Partial Evaluation and Semantics-based Program Manipulation (PEPM). ACM Press.
23. Taha, W. and Sheard, T. (1997) Multi-stage programming with explicit annotations. Proceedings Symposium on Partial Evaluation and Semantic-based Program Manipulation (PEPM), pp. 203-217. ACM Press.
24. Taha, W. and Sheard, T. (2000) MetaML: Multi-stage programming with explicit annotations. Theor. Comput. Sci. 248(1-2).
25. Taha, W., Benaissa, Z.-El-A. and Sheard, T. (1998) Multi-stage programming: Axiomatization and type-safety. 25th International Colloquium on Automata. Languages, and Programming (ICALP): Lecture Notes in Computer Science 1443, pp. 918-929. Springer-Verlag.
26. Thiemann, P. and Dussart, D. (1999) Partial evaluation for higher-order languages with state. (Available from http://www.informatik.uni-freiburg.de/thiemann/papers/index.html.)
27. Wickline, P., Lee, P. and Pfenning, F. (1998) Run-time code generation and Modal-ML. Proceedings Conference on Programming Language Design and Implementation (PLDI), pp. 224-235.
28. Wright, A. K. and Felleisen, M. (1994) A syntactic approach to type soundness. Infor. & Computation. 115(1). 38-94.
29. Xi, H. (1999) Dead code elimination through dependent types. First International Workshop on Practical Aspects of Declaratire Languages: Lecture Notes in Computer Science 1551.