Leveraging .NET meta-programming components from F# integrated queries and interoperable heterogeneous execution

Proceedings of the ACM SIGPLAN 2006 Workshop on ML

Volumn 2006, Issue , 2006, Pages 43-54

  Syme, Don ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Database languages; Domain specific languages; Functional programming; GPUs; LINQ; Meta programming; Reflection

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; DIGITAL LIBRARIES; FUNCTIONAL PROGRAMMING; PROGRAM COMPILERS; QUERY LANGUAGES;

DATABASE LANGUAGES; DOMAIN SPECIFIC LANGUAGES; META-PROGRAMMING;

METADATA;

EID: 34247396602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159876.1159884     Document Type: Conference Paper

References (34)

1. B. Beckman, G. Bierman, and E. Meijer. LINQ: Reconciling Objects, Relations, and XML In the .NET Framework. In Accepted to appear in SIGMOD, 2006.
2. N. Benton, A. Kennedy, and C. V. Russo. Adventures in interoperability: the SML.NET experience. In PPDP '04: Proceedings of the 6th ACM SIGPLAN International conference on Principles and Practice of Declarative Programming, pages 215-226, New York, NY, USA, 2004. ACM Press.
3. P. N. Benton, A. J. Kennedy, and G. Russell. Compiling Standard ML to Java bytecodes. In 3rd ACM SIGPLAN International Conference on Functional Programming, September 1998.
4. K. Bhargavan, C. Fournet, A. Gordon, and S. Tse. Verified interoperable implementations of security protocols. In Computer Security Foundations Workshop (CSFW), 2006.
5. G. Bierman, E. Meijer, and W. Schulte. The essence of data access in Cu. In Proceedings on the 19th European Conference on Object Oriented Programming, pages 287-311, July 2005.
6. P. Buneman, L. Libkin, D. Suciu, V. Tannen, and L. Wong. Comprehension syntax. SIGMOD Rec., 23(1):87-96, 1994.
7. K. Czarnecki, J. O'Donnell, J. Striegnitz, and W. Taha. Dsl implementation in metaocaml, template haskell, and c++.
8. J. Eckhardt, R. Kaiabachev, E. Pasalic, K. Swadi, and W. Taha. Implicitly Heterogeneous Multi-stage Programming. In Proceedings of GPCE '05, 2005.
9. ECMA International. ECMA Standard 334: C# language specification. See http://www.ecma-international.org.
10. ECMA International. ECMA Standard 335: Common Language Infrastructure. See http://www.ecma-international.org.
11. G. Ferrari, E. Moggi, and R. Pugliese. Metaklaim: a type safe multi-stage language for global computing. Mathematical. Structures in Comp. Sci., 14(3):367-395, 2004.
12. S. E. Ganz, A. Sabry, and W. Taha. Macros as multi-stage computations: type-safe, generative, binding macros in MacroML. In ICFP '01: Proceedings of the sixth ACM SIGPLAN International Conference on Functional Programming, pages 74-85. ACM Press, 2001.
13. M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF: A mechanised logic of computation. In Lecture Notes in Computer Science, volume 78. Springer Verlag, 1979.
14. J. Grundy, T. Melham, and J. O'Leary. A reflective functional language for hardware design and theorm proving. Technical Report PRG-RR-03-16, Oxford Univerity, Computing Laboratory, 2003.
15. L. J. Guibas and D. K. Wyatt. Compilation and delayed evaluation in APL. In POPL '78: Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 1-8, New York, NY, USA, 1978. ACM Press.
16. A. J. Kennedy and D. Syme. Design and implementation of Generics for the .NET Common Language Runtime. In Programming Language Design and Implementation. ACM, 2001.
17. B. A. LaMacchia, S. Lange, M. Lyons, R. Martin, and K. T. Price. .NET Framework Security. Pearson Education, 2002.
18. D. Leijen and E. Meijer. Domain specific embedded compilers. In 2nd USENIX Conference on Domain Specific Languages (DSL'99), pages 109-122, Austin, Texas, Oct. 1999. Also appeared in ACM SIGPLAN Notices 35, 1, (Jan. 2000), see also http://www.haskell.org/haskellDB/.
19. D. Luebke, M. Harris, J. Krüger, T. Purcell, N. Govindaraju, I. Buck, C. Woolley, and A. Lefohn. Gpgpu: general purpose computation on graphics hardware. In GRAPH '04: Proceedings of the conference on SIGGRAPH2004 course notes, page 33, New York, NY, USA, 2004. ACM Press.
20. Microsoft Corporation. The LINQ May 2006 Preview, 2006. See http://msdn.microsoft.com/data/ref/linq/.
21. M. Odersky, M. Sulzmann, and M. Wehr. Type Inference with Constrained Types. TAPOS, 5(1), 1999.
22. J. A. Orenstein and D. N. Kamber. Accessing a relational database through an object-oriented database interface. In VLDB '95: Proceedings of the 21th International Conference on Very Large Data Bases, pages 702-705, San Francisco, CA, USA, 1995. Morgan Kaufmann Publishers Inc.
23. J. Pobar and D. Russi. Late-bound invocation notes and Lightweight Code Gen, 2004. MSDN blog entry, See http://blogs.msdn.com/joelpob/archive/2004/04/ 01/105862.aspx.
24. T. Sheard, Z. Benaissa, and E. Pasalic. DSL implementation using staging and monads. In Domain-Specific Languages, pages 81-94, 1999.
25. T. Sheard and S. P. Jones. Template Meta-programming for Haskell. In Haskell '02: Proceedings of the 2002 ACM SIGPLAN workshop on Haskell, pages 1-16, New York, NY, USA, 2002. ACM Press.
26. D. Syme. Declarative Theorem Proving for Operational Semantics. PhD thesis, University of Cambridge, 1998.
27. D. Syme. ILX: Extending the .NET Common IL for Functional Language Interoperability. Electronic Notes in Theoretical Computer Science, 59(1), 2001.
28. D. Syme and J. Margetson. The F# website, 2006. See http://research. microsoft.com/fsharp/.
29. W. Taha and other contributors. MetaOCaml: a compiled, type-safe multi-stage programming language, 2006. See http://www.metaocaml.org/.
30. W. Taha and T. Sheard. MetaML and multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2):211-242, 2000.
31. D. Tarditi, S. Puri, and J. Oglesby. Accelerator: simplified programming of graphics processing units for general-purpose uses via data-parallelism. Technical Report MSR-TR-2005-184, Microsoft Research, December 2005.
32. P. Wadler. Views: a way for pattern matching to cohabit with data abstraction. In POPL '87: Proceedings of the 14th ACM SIGACTSIGPLAN symposium on Principles of programming languages, pages 307-313, New York, NY, USA, 1987. ACM Press.
33. M. Wand. The theory of fexprs is trivial. Lisp and Symbolic Computation, 10(3): 189-199, 1998.
34. H. Xi, C. Chen, and G. Chen. Guarded recursive datatype constructors. In POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 224-235, New York, NY, USA, 2003. ACM Press.