### bookmarks  (hide)1displayallbookmarks onlybookmarks per page5102050100sort byadded attitlefolkrankorderascendingdescendingRSSBibTeXXML

•

•

•

•

•

•

#### 1TheCatsters's YouTube Channel

Educational videos on various topics in category theory and related domains.
10 years ago by @draganigajic
(0)

•

#### 1Programming and Computation

Interpreting types as abstract values [The Abstract of the lecture notes] We expound a view of type checking as evaluation with `abstract values'. Whereas dynamic semantics, evaluation, deals with (dynamic) values like 0, 1, etc., static semantics, type checking, deals with approximations like int. A type system is sound if it correctly approximates the dynamic behavior and predicts its outcome: if the static semantics predicts that a term has the type int, the dynamic evaluation of the term, if it terminates, will yield an integer. As object language, we use simply-typed and let-polymorphic lambda calculi with integers and integer operations as constants. We use Haskell as a metalanguage in which to write evaluators, type checkers, type reconstructors and inferencers for the object language.
10 years ago by @draganigajic
(0)

•

•

•

•

•

#### 3Tutorial Papers in Functional Programming

•

In denotational semantics and functional programming, the terms monad morphism, monad layering, monad constructor, and monad transformer have by now accumulated 20 years of twisted history. The exchange between Eric Kidd and sigfpe about the probability monad prompted me to investigate this history
10 years ago by @draganigajic
(0)

•

•

#### 1A Neighborhood of Infinity: From Monoids to Monads

Generalising Monoids The word 'monad' is derived from the word 'monoid'. The explanation usually given is that there is an analogy between monoids and monads. On the surface, this seems a bit unlikely. The join operation in a monad is supposed to correspond to the binary operator in the monoid, but join is a completely different kind of thing, certainly not a binary operator in any usual sense. I'm going to make this analogy precise so that it's clear that both monoids and monads are examples of the same construction. In fact, I'm going to write some Haskell code to define monoids and monads in almost exactly the same way. I was surprised to find I could do this because instances of Haskell's Monoid and Monad aren't even the same kind of thing (where I'm using 'kind' in its technical sense). But it can be done.
10 years ago by @draganigajic
(0)

•

•

•

•

•

### publications  (hide)displayallpublications onlypublications per page5102050100sort byadded attitlefolkrankorderascendingdescendinghelp for advanced sorting...RSSBibTeXRDFmore...

•

#### 3A co-relational model of data for large shared data banks

E. Meijer, and G. Bierman. Commun. ACM (April 2011)
10 years ago by @hidders
(0)

•

#### 7Monads for functional programming

volume 925 of Lecture Notes in Computer Science, page 24--52. Springer, (1995)
13 years ago by @gron
(0)

•

•

#### 2Lightweight monadic regions.

O. Kiselyov, and C. chieh Shan. Haskell , page 1--12. ACM, (2008)
10 years ago by @mhwombat
(0)