Phobos: A front-end approach to extensible compilers

Proceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS 2003

Volumn , Issue , 2003, Pages

  Granicz, A ^a   Hickey, J ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SEMANTICS; SPECIFICATIONS;

DOMAIN SPECIFIC LANGUAGES; EXECUTABLE CODES; HIGHER-ORDER ABSTRACT SYNTAX; LANGUAGE SPECIFICATION; MODULAR LANGUAGE; PUSH-DOWN AUTOMATA; SECOND-ORDER SUBSTITUTION; SEMANTIC SPECIFICATION;

SYNTACTICS;

EID: 84969528776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2003.1174890     Document Type: Conference Paper

References (26)

1. A. V. Aho, S. C. Johnson, and J. D. Ullman. Deterministic parsing of ambiguous grammars. Communications of the ACM, 18(8):441-452, 1975.
2. S. F. Allen. A Non-type-theoretic Definition of Martin-Löf's Types. In Proc. of Second Symp. on Logic in Camp. Sci., pages 215-224. IEEE, June 1987.
3. S. F. Allen, R. L. Constable, D. J. Howe, and W, Aitken. The semantics of reflected proof. In Proc. of Fifth Symp. on Logic in Camp. Sci. , pages 95-197. IEEE, June 1990.
4. A. W. Appel. Modern compiler implementation in ML: basic techniques. Cambridge University Press, 1997.
5. B. Aydemir, A. Granicz, and J. Hickey. Formal Design Environments. International Conference on Theorem Proving in Higher Order Logics (TPHOLs), 2002. Appears in NASA technical report NASA/CP-2002-211736.
6. J. Bachrach and K. Playford. The Java syntactic extender (JSE). In Proceedings of the OOPSLA '01 Conference on Object Oriented Programming, Systems, Languages and Applications, pages 31-42. ACM Press, 2001.
7. Daniel de Rauglaudre . Camlp4. http://caml.inria.fr/camlp4, 2002.
8. J.-Y. Girard. Une extension de I'interpretation de Gödel a I'analyse, et sonapplication a I'elimination des coupures dans I'analyse et la theorie des types. In 2nd Scandinavian Logic Symp., pages 63-69. Springer-Verlag, NY, 1971.
9. A. Granicz and J. Hickey. Phobos: A front-end approach to extensible compilers (long version). Technical Report caltechCSTR:2002.006, Computer Science Dept., Califor nia Institute of Technology, 2002.
10. J. Heering and P. Klint. Semantics of programming languages: a tool-oriented approach. ACM SIGPLAN Notices, 35(3):39-48, 2000.
11. J. Hickey and A. Nogin. Fast tactic-based theorem proving. In Theorem Proving in Higher Order Logics (TPHOLs 2000), August 2000.
12. J. J. Hickey. The MetaPRL Logical Programming Environment. PhD thesis, Computer Science Dept., Cornell University, Ithaca, NY, 2001.
13. Isabelle Attali, Carine Courbis, Pascal Degenne, Alexandre Fau, Didier Parigot, and Claude Pasquier. SmartTools: A Generator of Interactive Environments Tools. In Reinhard Wilhelm, editor, 10th International Conference on Compiler Construction, volume 2027, pages 355-360. Lecture Notes in Computer Science, Springer-Verlag, 2001.
14. J. A. Goguen and G. Malcolm. Algebraic Semantics of Imperative Programs. MIT Press, 1996.
15. J. Hickey, J. D. Smith, A. Granicz, N. Gray, C. Tapus, and B. Aydemir, The Mojave Research Group Website. http://mojave.cs.caltech.edu.
16. Jean-Pierre Jouannaud, Rewrite Proofs and Computations. In Helmut Schwichtenberg, editor, Proof and Computation, volume 139, pages 173-218. Springer Verlag, 1995.
17. S. C. Johnson and R. Sethi. Yacc: a parser generator. pages 347-374, 1990.
18. J. v. Leeuwen, editor. Handbook of Theoretical Computer Science, Vol. B. Elsevier Science Publishers, 1990.
19. Luca Cardelli, Florian Matthes, and Martín Abadi. Extensible syntax with lexical scoping. Technical Report SRC 121, Digital Equipment Corporation Systems Research Center, 21 Feb. 1994.
20. M. Anlauff and P.W. Kutter and A. Pierantonio. Formal aspects and development environments for Montages, In M.P.A. Sellink, editor, 2nd International Workshop on the Theory and Practice of Algebraic Specifications (ASF+SDF'97). Electronic Workshops in Computing, Springer/British Computer Society, 1997.
21. M. G. J. van den Brand, J. Heering, P. Klint, and P. A. Olivier. Compiling Rewrite Systems: The ASF+SDF Compiler, ACM Transactions on Programming Languages and Systems, 24:334-368, 2002.
22. Mernik Marjan, Lenic Mitja, Avdicausevic Enis, and Zumer Viljem. LISA: An Interactive Environment for Programming Language Development, volume 2304. Lecture Notes in Computer Science, Springer-Verlag, 2002.
23. A. Nogin and J. Hickey. Sequent schema for derived rules. In Theorem Proving in Higher-Order Logics (TPHOLs '02), 2002.
24. R. Prieto-Díaz, Domain analysis: an introduction. ACM SIGSOFT Software Engineering Notes, 15(2):47-54, 1990.
25. D. Rémy and J. Vouillon. Objective ML: A simple object-oriented extension of ML. In ACM Symposium on Principles of Programming Languages, pages 40-53, 1997.
26. Steven E. Ganz and Amr Sabry and Walid Taha. Macros as multi-stage computations: type-safe, generative, binding macros in MacroML. In Proceedings of the 2001 ACM SIG PLAN International Conference on Functional Programming, pages 74-85. ACM Press, 2001.