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.
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.
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.
A. Ekbald (2015):
A Distributed Haskell for the Modern Web.
Licentiate thesis.
Chalmers University of Technology and Göteborg University.
P. Freeman (2017):
PureScript By Example.
Leanpub.
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.
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.
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.
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.
W. Sieg (2007):
The AProS project: Strategic thinking & computational logic.
Logic Journal of IGPL 15(4),
pp. 359–368,
doi:10.1093/jigpal/jzm026.
M. Snoyman (2012):
Developing web applications with Haskell and Yesod.
O'Reilly Media, Inc..