References

  1. Matthias Blume (2001): No-Longer-Foreign: Teaching an ML compiler to speak C "natively". Electr. Notes Theor. Comput. Sci. 59(1), pp. 36–52. Available at http://dx.doi.org/10.1016/S1571-0661(05)80452-9.
  2. Thomas Braibant & Damien Pous (2010): An Efficient Coq Tactic for Deciding Kleene Algebras. In: Interactive Theorem Proving, First International Conference, ITP 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, Lecture Notes in Computer Science 6172. Springer, pp. 163–178. Available at http://dx.doi.org/10.1007/978-3-642-14052-5_13.
  3. Wei-Ngan Chin & Siau-Cheng Khoo (2001): Calculating Sized Types. Higher-Order and Symbolic Computation 14(2-3), pp. 261–300. Available at http://dx.doi.org/10.1023/A:1012996816178.
  4. Sa Cui, Kevin Donnelly & Hongwei Xi (2005): ATS: A Language That Combines Programming with Theorem Proving. In: FroCoS, Lecture Notes in Computer Science 3717. Springer, pp. 310–320. Available at http://dx.doi.org/10.1007/11559306_19.
  5. Olivier Danvy (1998): Functional Unparsing. J. Funct. Program. 8(6), pp. 621–625. Available at http://dx.doi.org/10.1017/S0956796898003104.
  6. Frederik Eaton (2006): Statically typed linear algebra in Haskell. In: Proceedings of the ACM SIGPLAN Workshop on Haskell, Haskell 2006, Portland, Oregon, USA, September 17, 2006. ACM, pp. 120–121. Available at http://dx.doi.org/10.1145/1159842.1159859.
  7. Eigen. http://eigen.tuxfamily.org/.
  8. Matthew Fluet & Riccardo Pucella (2006): Phantom types and subtyping. J. Funct. Program. 16(6), pp. 751–791. Available at http://dx.doi.org/10.1017/S0956796806006046.
  9. Mark Galassi: the GNU Scientific Library (GSL). http://www.gnu.org/software/gsl/.
  10. Ralf Hinze (2003): Fun with phantom types. In: Jeremy Gibbons & Oege de Moor: The Fun of Programming, Cornerstones of Computing. Palgrave Macmillan, pp. 245–262.
  11. hyone: Length Indexed Matrix and Indexed Functor. https://gist.github.com/hyone/3990929.
  12. Oleg Kiselyov & Chung chieh Shan (2007): Lightweight Static Capabilities. Electr. Notes Theor. Comput. Sci. 174(7), pp. 79–104. Available at http://dx.doi.org/10.1016/j.entcs.2006.10.039.
  13. Daan Leijen & Erik Meijer (1999): Domain specific embedded compilers. In: Proceedings of the Second Conference on Domain-Specific Languages (DSL '99), Austin, Texas, USA, October 3-5, 1999. ACM, pp. 109–122. Available at http://dx.doi.org/10.1145/331960.331977.
  14. Markus Mottl: OCaml-GPR – Efficient Gaussian Process Regression in OCaml. https://github.com/mmottl/gpr.
  15. Markus Mottl & Christophe Troestler: LACAML – Linear Algebra for OCaml. https://github.com/mmottl/lacaml.
  16. NetLib: BLAS (Basic Linear Algebra Subprograms). http://www.netlib.org/blas/.
  17. NetLib: LAPACK – Linear Algebra PACKage. http://www.netlib.org/lapack/.
  18. Stanford University's Pervasive Parallelism Laboratory (PPL): OptiML. http://stanford-ppl.github.io/Delite/optiml/.
  19. Tim Sheard & Simon L. Peyton Jones (2002): Template meta-programming for Haskell. SIGPLAN Notices 37(12), pp. 60–75. Available at http://dx.doi.org/10.1145/636517.636528.
  20. Arvind K. Sujeeth, HyoukJoong Lee, Kevin J. Brown, Tiark Rompf, Hassan Chafi, Michael Wu, Anand R. Atreya, Martin Odersky & Kunle Olukotun (2011): OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning. In: Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, 2011. Omnipress, pp. 609–616.
  21. uBlas. http://www.boost.org/doc/libs/1_55_0/libs/numeric/ublas/doc/.
  22. Hongwei Xi (2007): Dependent ML – An approach to practical programming with dependent types. J. Funct. Program. 17(2), pp. 215–286. Available at http://dx.doi.org/10.1017/S0956796806006216.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org