characterization of subset of Monads that respect tail calls?

Carter Schonwald <[email protected]> Mon, 26 Sep 2022 16:38:47 -0400
Newsgroups gmane.comp.lang.haskell.libraries
Message-ID <CAHYVw0w5h_35X7kouR0xkROVfA6RkrpAV4AtOonkCJLH1ageBg@mail.gmail.com>
--===============2082722907941645296==
Content-Type: multipart/alternative; boundary="000000000000ced9c305e99a843f"

--000000000000ced9c305e99a843f
Content-Type: text/plain; charset="UTF-8"

Hello everyone!
a recent conversation I has having led to an interesting question: is there
a good interface or something for Monads which guarantee tail calls are
tail calls? (ideally via a stronger api assumption for tail position
computations in a monad rather than "trustme" style api contracts)

thx
-Carter

--000000000000ced9c305e99a843f
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hello everyone!<div>a recent conversation I has having led=
 to an interesting question: is there a good interface or something for Mon=
ads which guarantee tail calls are tail calls? (ideally via a stronger api =
assumption for tail position computations in a monad rather than &quot;trus=
tme&quot; style api contracts)</div><div><br></div><div>thx=C2=A0</div><div=
>-Carter</div></div>

--000000000000ced9c305e99a843f--

--===============2082722907941645296==
Content-Type: text/plain; charset="utf-8"
MIME-Version: 1.0
Content-Transfer-Encoding: base64
Content-Disposition: inline

X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX18KTGlicmFyaWVz
IG1haWxpbmcgbGlzdApMaWJyYXJpZXNAaGFza2VsbC5vcmcKaHR0cDovL21haWwuaGFza2VsbC5v
cmcvY2dpLWJpbi9tYWlsbWFuL2xpc3RpbmZvL2xpYnJhcmllcwo=

--===============2082722907941645296==--