Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] How to define the free monad generated by a functor?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] How to define the free monad generated by a functor?


chronological Thread 
  • From: Andre.HIRSCHOWITZ AT unice.fr
  • To: Conor McBride <conor AT strictlypositive.org>
  • Cc: coq-club AT pauillac.inria.fr
  • Subject: Re: [Coq-Club] How to define the free monad generated by a functor?
  • Date: Mon, 02 Mar 2009 12:19:51 +0100
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Hello Conor,

Thanks for your nice contribution which perfectly illustrated what I meant by a clever answer. Fortunately unclever questions and answers are still welcome on this list.
BTW, I also enjoy your address.


However, it would be nice in the long run if we could replace
the positivity criterion with a more semantic criterion --- a
signature of operations and laws your F should come packaged
with to qualify as strictly positive, the way in Haskell you
need to know Functor e to show Monad (FreeM e).
Marco and I have recently revisited a proposal of Matthes-Uustalu about such a
"signature of operations and laws your F COULD come packaged
with". More precisely, they (and we) start from a higher-order functor
F : (Type ->Type )-> (Type->Type).
Hence we are certainly interested in your thoughts.

andré








Archive powered by MhonArc 2.6.16.

Top of Page