Entities Mentioned

• Haskell
• Simon Peyton Jones
• Philip Wadler
• John Hughes
• Cambridge University Press
• Standard ML
• MIT Press
• Springer Verlag
• John Launchbury
• Science of Computer Programming
• Yale University
• Algol
• Addison Wesley
• University of Edinburgh
• Theoretical Computer Science
• University of Glasgow
• Prentice Hall
• Kevin Hammond
• Logic in Computer Science
• Eugenio Moggi
• Will Partain
• A. Turner
• Department of Computing Science

1. This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required. Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exception (Read Full Article)
   
   

   Related Articles

   • Design Patterns in Haskell: push and pull
   • also mentions Algol
   • Yet Another Haskell Tutorial
   • also mentions Kevin Hammond
   • Quicksort in Haskell
   • also mentions John Launchbury
   • DSL Implementation in MetaOCaml, Template Haskell, and C++
   • also mentions Theoretical Computer Science
   • The Imaginary Concurrency Debate
   • also written by polivares

   • Haskell (programming language)
   • also mentions Philip Wadler
   • history.pdf (application/pdf Object)
   • also mentions Eugenio Moggi
   • Pugs: Software Transactional Memory comes to Pugs.
   • also written by polivares
   • Hudak: Building Domain-Specific Embedded Languages
   • also mentions Yale University
   • Supercompilation for Haskell
   • also mentions Haskell

Login to comment.