ML-Like Inference for Classifiers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2986, Issue , 2004, Pages 79-93

  Calcagno, Cristiano ^a   Moggi, Eugenio ^b   Taha, Walid ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF GENOA   (Italy)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

MULTI STAGE; NEW APPROACHES; ORIGINAL SYSTEMS; TYPE CHECKER;

BIOMINERALIZATION;

EID: 35048882935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_7     Document Type: Article

References (31)

1. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 13(2):237-268, April 1991.
2. Alan Bawden. Quasiquotation in LISP. In O. Danvy, editor, Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 88-99, San Antonio, 1999. University of Aarhus, Dept. of Computer Science. Invited talk.
3. Cristiano Calcagno, Eugenio Moggi, and Tim Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 2003. To appear.
4. Cristiano Calcagno, Walid Taha, Liwen Huang, and Xavier Leroy. Implementing multi-stage languages using asts, gensym, and reflection. In Krzysztof Czarnecki, Frank Pfenning, and Yannis Smaragdakis, editors, Generative Programming and Component Engineering (GPCE), Lecture Notes in Computer Science. Springer-Verlag, 2003.
5. Luís Damas and Robin Milner. Principal type schemes for functional languages. In 9th ACM Symposium on Principles of Programming Languages. ACM, August 1982.
6. Rowan Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184-195, New Brunswick, 1996. IEEE Computer Society Press.
7. Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96), pages 258-270, St. Petersburg Beach, 1996.
8. Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-604, 2001.
9. Dawson R. Engler, Wilson C. Hsieh, and M. Frans Kaashoek. 'C: A language for high-level, efficient, and machine-independent dynaic code generation. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL), pages 131-144, St. Petersburg Beach, 1996.
10. Steven Ganz, Amr Sabry, and Walid Taha. Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML. In the International Conference on Functional Programming (ICFP '01), Florence, Italy, September 2001. ACM.
11. Carsten K. Gomard and Neil D. Jones. A partial evaluator for untyped lambda calculus. Journal of Functional Programming, 1(1):21-69, 1991.
12. Brian Grant, Matthai Philipose, Markus Mock, Craig Chambers, and Susan J. Eggers. An evaluation of staged run-time optimizations in DyC. In Proceedings of the Conference on Programming Language Design and Implementation, pages 293-304, 1999.
13. J. Roger Hindley. Basic Simple Type Theory, volume 42 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1997.
14. Trevor Jim. What are principal typings and what are they good for? In Conf. Rec. POPL '96: 23rd ACM Symp. Princ. of Prog. Langs., 1996.
15. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
16. Sam Kamin, Miranda Callahan, and Lars Clausen. Lightweight and generative components II: Binary-level components. In [27], pages 28-50, 2000.
17. John Launchbury and Simon L. Peyton Jones. State in haskell. LISP and Symbolic Computation, 8(4):293-342, 1995.
18. John Launchbury and Amr Sabry. Monadic state: Axiomatization and type safety. In Proceedings of the International Conference on Functional Programming, Amsterdam, 1997.
19. MetaOCaml: A compiled, type-safe multi-stage programming language. Available online from http://www.cs.rice.edu/ taha/MetaOCaml/, 2001.
20. The MetaML Home Page, 2000. Provides source code and documentation online at http://www.cse.ogi.edu/PacSoft/projects/metaml/index.html.
21. A. Nanevski and F. Pfenning. Meta-programming with names and necessity, submitted, 2003.
22. Flemming Nielson and Hanne Riis Nielson. Two-level semantics and code generation. Theoretical Computer Science, 56(1):59-133, 1988.
23. Tim Sheard and Simon Peyton-Jones. Template meta-programming for haskell. In Proc. of the workshop on Haskell, pages 1-16. ACM, 2002.
24. Mark Shields, Tim Sheard, and Simon L. Peyton Jones. Dynamic typing through staged type inference. In In proceedings of the ACM Symposium on Principles of Programming Languages (POPL), pages 289-302, 1998.
25. Frederick Smith, Dan Grossman, Greg Morrisett, Luke Hornof, and Trevor Jim. Compiling for run-time code generation. Journal of Functional Programming, 2003.
26. Walid Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999.
27. Walid Taha, editor. Semantics, Applications, and Implementation of Program Generation, volume 1924 of Lecture Notes in Computer Science, Montreal, 2000. Springer-Verlag.
28. Walid Taha. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trivial. In Proceedings of the Workshop on Partial Evaluation and Semantics-Based Program Maniplation (PEPM), Boston, 2000. ACM Press.
29. Walid Taha and Michael Florentin Nielsen. Environment classifiers. In The Symposium on Principles of Programming Languages (POPL '03), New Orleans, 2003.
30. Walid Taha and Tim Sheard. Multi-stage programming with explicit annotations. In Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM), pages 203-217, Amsterdam, 1997. ACM Press.
31. Joe Wells. The essence of principal typings. In Proc. 29th Int'l Coll. Automata, Languages, and Programming, volume 2380 of Lecture Notes in Computer Science, pages 913-925. Springer-Verlag, 2002.