References

  1. (2017): WebAssembly: High Level Goals. Available at http://webassembly.org/docs/high-level-goals/.
  2. (2017): WebGHC. Available at https://webghc.github.io/.
  3. L.D. Baxter (1977): The Complexity of Unification. University of Waterloo, New York.
  4. A. Bergmark (2010): Fay. Available at https://github.com/faylang/fay/wiki.
  5. J. Breitner (2016): Visual Theorem Proving with the Incredible Proof Machine. In: Blanchette J. & Merz S.: Interactive Theorem Proving—ITP 2016, Lecture Notes in Computer Science 9807. Springer, pp. 123–139, doi:10.1007/978-3-319-43144-4_8.
  6. E. Czaplicki & S. Chong (2013): Asynchronous Functional Reactive Programming for GUIs. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation—PLDI. ACM Press, pp. 411–422, doi:10.1145/2491956.2462161.
  7. G. Dowek (2001): Higher-Order Unification and Matching. In: A.J Robinson & A. Voronkov: Handbook of Automated Reasoning. Elsevier, pp. 1009–1062, doi:10.1016/B978-044450813-3/50018-7.
  8. A. Ekbald (2015): A Distributed Haskell for the Modern Web. Licentiate thesis. Chalmers University of Technology and Göteborg University.
  9. P. Freeman (2017): PureScript By Example. Leanpub.
  10. G. Hardegree (2016): Introduction to Modal Logic. Online Textbook. Available at http://courses.umass.edu/phil511-gmh/text.htm.
  11. M. Henz & J. Hobor (2011): Teaching Experience: Logic and Formal Methods with Coq. In: J. Jouannaud & Z. Shao: Certified Programs and Proofs—CPP 2011, Lecture Notes in Computer Science 7086. Springer, pp. 199–215, doi:10.1007/978-3-642-25379-9_16.
  12. R. Kirsling (2017): The Modal Logic Playground. Available at https://rkirsling.github.io/modallogic/.
  13. O. Kiselyov, C. C. Shan, D. P. Friedman & A. Sabry (2005): Backtracking, interleaving, and terminating monad transformers. ACM SIGPLAN Notices 40(9), pp. 192–203, doi:10.1145/1090189.1086390.
  14. G. Leach-Krouse (2017): About Carnap. Available at http://carnap.io/about.
  15. G. Leach-Krouse (2017): Carnap @ ThEdu2017. Presentation at ThEdu2017, Göteborg, Sweden. Available at https://gleachkr.github.io/CADEslides/.
  16. G. Leach-Krouse (2017): The Carnap Book. Online Textbook. Available at http://carnap.io/book.
  17. J. MacFarlane (2017): Pandoc. Available at https://www.pandoc.org/.
  18. T. Nipkow (1993): Functional unification of higher-order patterns. In: Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science, 1993—LICS'93. IEEE, pp. 64–74, doi:10.1109/LICS.1993.287599.
  19. B. Peirce (2009): Lambda: The Ultimate TA. In: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming—ICFP'09. ACM, pp. 121–122, doi:10.1145/1596550.1596552.
  20. W. Sieg (2007): The AProS project: Strategic thinking & computational logic. Logic Journal of IGPL 15(4), pp. 359–368, doi:10.1093/jigpal/jzm026.
  21. M. Snoyman (2012): Developing web applications with Haskell and Yesod. O'Reilly Media, Inc..
  22. L. Stegeman (2013): Concurrent Haskell in the Browser with GHCJS. Presentation at ZuriHac 2013, Zurich, Switzerland. Available at https://wiki.haskell.org/ZuriHac2013#FP_Afternoon.
  23. W. Swierstra (2008): Data types à la carte. Journal of functional programming 18(4), pp. 423–436, doi:10.1017/S0956796808006758.

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