Difference between revisions of "Publications/newton.16.monad.report"
From LRDE
(Created page with "{{Publication | published = true | date = 2016-11-18 | lrdekeywords = monad, scala, lisp | lrdenewsdate = 2016-11-18 | lrdepaper = http://www.lrde.epita.fr/dload/papers/newton...") |
|||
Line 10: | Line 10: | ||
| institution = LRDE |
| institution = LRDE |
||
| address = Paris, France |
| address = Paris, France |
||
− | | abstract = In this article we explain monads so they can be understood to the Lisp programmer. |
+ | | abstract = In this article we explain monads so they can be understood to the Lisp programmer. We base the explanation on a very clean explanation presented in the Scala programming language. We then proceed to re-present the concepts using mostly simple cl concepts. We do not attempt to justify the motivation behind the definitionsand we do not attempt to give any examples of applications. Most notably, we do not attempt to explain the connection monads have to modeling side effects. |
| type = techreport |
| type = techreport |
||
| id = newton.16.monad.report |
| id = newton.16.monad.report |
Revision as of 17:38, 19 January 2017
- Authors
- Jim Newton
- Place
- Paris, France
- Type
- techreport
- Projects
- Climb
- Keywords
- monad, scala, lisp
- Date
- 2016-11-18
Abstract
In this article we explain monads so they can be understood to the Lisp programmer. We base the explanation on a very clean explanation presented in the Scala programming language. We then proceed to re-present the concepts using mostly simple cl concepts. We do not attempt to justify the motivation behind the definitionsand we do not attempt to give any examples of applications. Most notably, we do not attempt to explain the connection monads have to modeling side effects.
Documents
Bibtex (lrde.bib)
@TechReport{ newton.16.monad.report, author = {Jim Newton}, title = {Monads in Common Lisp}, institution = {LRDE}, year = 2016, address = {Paris, France}, month = nov, abstract = {In this article we explain monads so they can be understood to the Lisp programmer. We base the explanation on a very clean explanation presented in the Scala programming language. We then proceed to re-present the concepts using mostly simple \cl concepts. We do not attempt to justify the motivation behind the definitions, and we do not attempt to give any examples of applications. Most notably, we do not attempt to explain the connection monads have to modeling side effects. } }