Is there a programming language out there that sort of has… built in recursion schemes? i.e. so that you don’t need to remember a menagerie of different weirdly named functions, juggle fix datatypes or do painful stuff to support mutual recursion? I know of the “catamorphisms” in the nanopass framework (https://nanopass.org/), which essentially let you forward through a transformation automatically and elide boilerplate cases, but I’m hoping for something more general.
=> More informations about this toot | View the thread | More toots from brendan@types.pl
text/geminiThis content has been proxied by September (ba2dc).