Referências

[1]

[2]

Carlos Camarão, Lucília Figueiredo, and Rodrigo Ribeiro. Ambiguity and Constrained Polymorphism. Science of Computer Programming, 124(1):1–19, 2016.

[3]

Luís Damas and Robin Milner. Principal type schemes for functional programs. In Proc. of POPL’82, pages 207–212, 1982.

[4]

Martin Grabmüller. Monad Transformers Step by Step. http://catamorph.de/publications/2004-10-01-monad-transformers.html, October 2006.

[5]

Simon Peyton Jones et al. GHC — The Glasgow Haskell Compiler. http://www.haskell.org/ghc/, 1998.

[6]

P. Martin-Löf. Constructive Mathematics and Computer Programming. In Proc. of a Discussion Meeting of the Royal Society of London on Mathematical Logic and Programming Languages, pages 167–184. Prentice-Hall, Inc., 1985.

[7]

Jeff Newbern. Haskell/Monad transformers, (usado em) Junho de 2017. https://en.wikibooks.org/wiki/Haskell/Monad_transformers.

[8]

Bryan O’Sullivan, John Goerzen, and Don Stewart. Real World Haskell. O’Reilly Media, Inc., 2008.

[9]

Carlos Camarão Rodrigo Ribeiro. Ambiguity and Context-Dependent Overloading. Journal of the Brazilian Computer Society, 19(3):313–324, 2013.

[10]

Simon Thompson. The Craft of Functional Programming, terceira edição. Pearson Education Limited, 2011.

[11]

Geoffrey Smith. Polymorphic Type Inference for Languages with Overloading and Subtyping. PhD thesis, Cornell University, 1991.

[12]

Morten Heine Sørensen and Pawel Urzyczyn. Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics). Elsevier Science Inc., New York, NY, USA, 2006.

[13]

Dennis Volpano and Geoffrey Smith. On the Complexity of ML Typability with Overloading. In Proc. of the ACM Symposium on Functional Programming Computer Architecture., number 523 in LNCS, pages 15–28, 1991.