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...") |
|||
| (3 intermediate revisions by the same user not shown) | |||
| 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 Common Lisp 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. |
| type = techreport |
| type = techreport |
||
| id = newton.16.monad.report |
| id = newton.16.monad.report |
||
| Line 16: | Line 16: | ||
@TechReport<nowiki>{</nowiki> newton.16.monad.report, |
@TechReport<nowiki>{</nowiki> newton.16.monad.report, |
||
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
||
| − | title = <nowiki>{</nowiki>Monads in |
+ | title = <nowiki>{</nowiki>Monads in <nowiki>{</nowiki>C<nowiki>}</nowiki>ommon <nowiki>{</nowiki>L<nowiki>}</nowiki>isp<nowiki>}</nowiki>, |
institution = <nowiki>{</nowiki>LRDE<nowiki>}</nowiki>, |
institution = <nowiki>{</nowiki>LRDE<nowiki>}</nowiki>, |
||
year = 2016, |
year = 2016, |
||
| Line 25: | Line 25: | ||
on a very clean explanation presented in the Scala |
on a very clean explanation presented in the Scala |
||
programming language. We then proceed to re-present the |
programming language. We then proceed to re-present the |
||
| − | concepts using mostly simple |
+ | concepts using mostly simple Common Lisp concepts. We do |
| − | attempt to justify the motivation behind the |
+ | not attempt to justify the motivation behind the |
| − | and we do not attempt to give any examples of |
+ | definitions, and we do not attempt to give any examples of |
| − | Most notably, we do not attempt to explain |
+ | applications. Most notably, we do not attempt to explain |
| − | monads have to modeling side effects. <nowiki>}</nowiki> |
+ | the connection monads have to modeling side effects. <nowiki>}</nowiki> |
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 12:22, 3 December 2022
- 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 Common Lisp 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.
Documents
Bibtex (lrde.bib)
@TechReport{ newton.16.monad.report,
author = {Jim Newton},
title = {Monads in {C}ommon {L}isp},
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 Common Lisp 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. }
}