Search results
Jump to navigation
Jump to search
- ...not in-place, but it has the same spirit and recursion pattern. -- [[User:Apfelmus|apfe<b>λ</b>mus]] 08:26, 12 June 2008 (UTC)344 bytes (51 words) - 08:26, 12 June 2008
- apfelmus pointed out that decoding must be allowed to fail (e.g. using <hask>Maybe</626 bytes (84 words) - 18:44, 21 October 2007
- ...It's more a cheatsheet than a cookbook, but who cares. -- [[User:Apfelmus|Apfelmus]] 19:19, 25 February 2007 (UTC)3 KB (519 words) - 08:07, 13 May 2013
- apfelmus at quantentunnel.de apfelmus at quantentunnel.de apfelmus5 KB (787 words) - 11:02, 26 December 2017
- ** Maintainer: [http://apfelmus.nfshost.com/ Heinrich Apfelmus] <apfelmus at quantentunnel de>1 KB (183 words) - 22:25, 4 January 2015
- -- tree folding idea Heinrich Apfelmus / Dave Bayer2 KB (296 words) - 13:50, 21 February 2023
- ...=32749#Treefold_Merged_Multiples_Removal treefolding merge] is inspired by apfelmus's VIP code from [http://www.haskell.org/haskellwiki/index.php?title=Prime_n12 KB (1,896 words) - 10:21, 2 February 2013
- ...ww.haskell.org/pipermail/haskell-cafe/2007-November/035263.html "lens"] by Apfelmus in Haskell-Cafe. The thread started with [http://www.haskell.org/pipermail/6 KB (1,022 words) - 13:33, 17 January 2012
- .../www.haskell.org/pipermail/haskell-cafe/2008-December/051585.html Heinrich Apfelmus]:4 KB (621 words) - 05:56, 26 April 2021
- ** [http://apfelmus.nfshost.com/blog.html#functional-reactive-programming-frp Developer Blog] ** Maintainer: [http://apfelmus.nfshost.com/ Heinrich Apfelmus]5 KB (615 words) - 21:05, 4 January 2016
- ; Heinrich Apfelmus6 KB (743 words) - 16:02, 26 April 2017
- ''The following steps seem obsolete to me. -- Apfelmus''4 KB (674 words) - 05:29, 8 June 2023
- ** [http://apfelmus.nfshost.com/blog.html#gui-programming Developer Blog] ** Maintainer: [http://apfelmus.nfshost.com/ Heinrich Apfelmus]6 KB (786 words) - 00:53, 12 February 2022
- ...mple (list concatenation). For mergesort, it's the other way round. [[User:Apfelmus|apfe<b>λ</b>mus]] 10:51, 11 December 2007 (UTC)8 KB (1,269 words) - 20:14, 24 January 2013
- apfelmus 20076 KB (1,024 words) - 23:56, 25 June 2021
- * Heinrich Apfelmus (I dislike:7 KB (1,198 words) - 05:55, 10 December 2020
- ...log.html#functional-reactive-programming-frp FRP-related posts on Heinrich Apfelmus’ blog] * [http://apfelmus.nfshost.com/ Heinrich Apfelmus]11 KB (1,615 words) - 05:58, 7 November 2022
- ...ikibooks.org/wiki/Haskell/Understanding_monads Understanding Monads] (2) - Apfelmus34 KB (4,819 words) - 08:52, 24 April 2024
- ...e to Dave Bayer] and [[Prime_numbers_miscellaneous#Implicit_Heap|Heinrich Apfelmus]]:58 KB (8,594 words) - 20:34, 6 May 2023
- ...g a domain-specific language, see [http://projects.haskell.org/operational Apfelmus's operational package]. Heinrich Apfelmus’ [http://apfelmus.nfshost.com/monoid-fingertree.html Monoids and Finger Trees], an accessible179 KB (29,519 words) - 16:10, 30 December 2022