Implementacja języków funkcyjnych

Seminarium poświęcone jest technikom i rozwiązaniom stosowanym w kompilatorach języków funkcyjnych takich jak Haskell, Ocaml, Scheme i SML. Omawiane tematy obejmują: algorytmy rekonstrukcji typów, analizę statyczną oraz optymalizację kodu, transformacje programów, języki pośrednie oraz maszyny wirtualne.

Literatura

• Haskell

  [PJ87]	Simon Peyton Jones. The implementation of functional programming languages. Prentice Hall, 1987.
  [PJL92]	Simon Peyton Jones and David Lester. Implementing functional languages: a tutorial. Prentice Hall, 1992.
  [PJ92]	Simon Peyton Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming 2(2), April 1992, pp. 127-202.
  [MPJ03]	Simon Marlow and Simon Peyton Jones. The Glasgow Haskell Compiler.
  [PB10]	Maciej Piróg and Dariusz Biernacki. A Systematic derivation of the STG machine verified in Coq. In Proceedings of the 3rd ACM Haskell Symposium, pp. 25-36, Baltimore, MD, September 2010.

• OCaml

  [L90]	Xavier Leroy. The ZINC experiment: an economical implementation of the ML language. Technical report 117, INRIA, 1990.
  [L02]	Xavier Leroy. Compiling functional languages. Spring school on semantics of programming languages, Agay, France, 2002.
  [L07]	Xavier Leroy. Compilation and abstract machines, part1 and part2 (in French). École Jeunes Chercheurs en Programmation, France, 2007.

• Scheme

  [Q96]	Christian Queinnec. Lisp in small pieces. Cambridge University Press, 1996.
  [FF03]	Matthias Felleisen and Matthew Flatt. Programming languages and lambda calculi. Lecture notes, 2003.

• SML

  [AJ89]	Andrew W. Appel and Trevor Jim. Continuation-passing, closure-passing style. The In Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pp. 293-302, Austin, Texas, January 1989.
  [A92]	Andrew W. Appel. Compiling with continuations. Cambridge University Press, 1992.
  [K07]	Andrew Kennedy. Compiling with continuations, continued. In Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, pp. 177-190, Freiburg, Germany, October 2007.

• Inne

  [R72]	John Reynolds. Definitional interpreters for higher-order programming languages. Higher-Order and Symbolic Computation, 11(4):363–397, 1998.
  [ABDM03]	Mads Sig Ager, Dariusz Biernacki, Olivier Danvy and Jan Midtgaard. A functional correspondence between evaluators and abstract machines. In Proceedings of the 5th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 8-19, Uppsala, Sweden, August 2003.
  [ADM04]	Mads Sig Ager, Olivier Danvy and Jan Midtgaard. A functional correspondence between call-by-need evaluators and lazy abstract machines. Information Processing Letters, 90(5):223-232, 2004.
  [LLVM]	The LLVM Compiler Infrastructure Project.
  [Kal]	Kaleidoscope: Implementing a Language with LLVM in Objective Caml.

Terminarz