tag:blogger.com,1999:blog-18772787429101588612024-09-12T22:32:17.175-07:00What do Haskellers have for breakfast? Co-Co-Monads!approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.comBlogger9125tag:blogger.com,1999:blog-1877278742910158861.post-48233023626965675572010-08-14T03:32:00.000-07:002010-08-14T03:50:17.698-07:00Inspired by this <a href="http://www.mostlymaths.net/2010/08/and-e-appears-from-nowhere.html">lovely blogpost</a> I decided to write my own slow and arcane "e" maker. Please compile it before running, otherwise it has runtime complexity O(forever).<br /><br /><script src="http://gist.github.com/524200.js?file=slow%20slow%20e.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-82809003974233931062010-08-03T17:15:00.000-07:002010-08-03T17:16:38.737-07:00<script src="http://gist.github.com/507430.js?file=niceprimes.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-75430758759123998052010-06-27T09:49:00.000-07:002010-06-27T09:57:45.328-07:00A simple little quine. A quaint quine.<br /><script src="http://gist.github.com/455016.js?file=basicquine.hs"></script><br />Fancier applicative version, because it's more hardcore.<br /><script src="http://gist.github.com/455012.js?file=fancyapplicativequine.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com1tag:blogger.com,1999:blog-1877278742910158861.post-62120651886488839092010-06-17T02:21:00.000-07:002010-06-17T02:27:47.679-07:00Haskell is a great logical language and can be used for proofs and has Curry-Howard isomorphic-mathematical-glorious beauty. With that in mind I feel that when ghci says Peano's eighth postulate is false you best listen. <br /><br /><script src="http://gist.github.com/441900.js?file=lame.lhs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-88504554284681575932010-06-02T17:16:00.000-07:002010-06-02T17:19:03.134-07:00As usual it's slow. It could be made much faster by using a parallel map. That's an exercise for the reader. Also PPM is terrible for anything but writing to, it must be converted immediately.<script src="http://gist.github.com/423229.js?file=Mandelthing.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-62090898762500674742010-05-20T11:37:00.001-07:002010-05-20T15:46:35.783-07:00<script src="http://gist.github.com/408219.js?file=gistfile1.hsc"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-55200412296940770312010-05-11T09:14:00.000-07:002010-05-11T13:30:58.873-07:00Ever wish you could do things like (+ 3 4 5) from LISP, but in Haskell? Wish no more with the beautiful FoldyList datatype! An example instance for Show is given but feel free to write your own, otherwise the code is next to useless.<br /><br /><script src="http://gist.github.com/397826.js?file=FoldyList.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com2tag:blogger.com,1999:blog-1877278742910158861.post-52664712833776648042010-03-23T16:44:00.000-07:002010-06-02T17:26:10.921-07:00It's not very fast, but at least it'll work on arbitrary real functions.<script src="http://gist.github.com/423241.js?file=BSIntegration.hs"></script>approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0tag:blogger.com,1999:blog-1877278742910158861.post-70964579731435269912010-03-23T16:35:00.000-07:002010-03-23T16:41:03.017-07:00So for a function f on an interval (a,b) the length of the curve produced is given by:<br /><pre lang="eq.latex">\int_a^b \sqrt{f'(x)^2+1} \, dx</pre><br /><br />You can try it using f(x)=x and get 2^(1/2) x, how thrilling.approxhttp://www.blogger.com/profile/14437325118483171429noreply@blogger.com0