muad dib - Robuta Search

https://muaddibspace.blogspot.com/2008/08/tail-call-optimization-doesnt-exist-in.html Muad`Dib: Tail Call Optimization doesn't exist in Haskell It's well known that since Haskell programs are evaluated lazily, the considerations for writing recursive code are different to those of a ... tail call optimization muad dib exist haskell https://muaddibspace.blogspot.com/2009/01/beta-eta-equality-for-stlc-by-nbe.html Muad`Dib: beta eta equality for STLC by NbE muad dib beta equality stlc nbe https://muaddibspace.blogspot.com/2008/01/counting-infinity.html Muad`Dib: Counting Infinity muad dib counting infinity https://muaddibspace.blogspot.com/2008/11/variadic-via-gadt.html Muad`Dib: Variadic via GADT muad dib via gadt https://muaddibspace.blogspot.com/2008/03/ Muad`Dib: March 2008 muad dib march https://muaddibspace.blogspot.com/2008/01/include-include-file-input-key-output.html Muad`Dib: XOR Encryption muad dib xor encryption https://muaddibspace.blogspot.com/2008/10/eqfindec-via-noconfusion.html Muad`Dib: eq_fin_dec via NoConfusion muad dib eq fin dec via https://muaddibspace.blogspot.com/2008/12/common-subexpression-elimination.html Muad`Dib: Common Subexpression Elimination ;; My example of when mutation is a useful tool that simplifies things. (define (identity i) i) (define (concat xs) (apply append xs)) (defi... muad dib common elimination https://muaddibspace.blogspot.com/2008/11/somewhat-pointfree-haskell-huffman-tree.html Muad`Dib: Somewhat Pointfree Haskell Huffman Tree muad dib somewhat haskell huffman tree https://muaddibspace.blogspot.com/2008/12/axiom-free-noconfusion-in-coq.html Muad`Dib: Axiom Free NoConfusion in Coq muad dib axiom free coq https://muaddibspace.blogspot.com/2008/12/other-peoples-thoughts.html Muad`Dib: Other Peoples Thoughts "i kinda like haskell and erlang but i don't think they make it any easier to do anything. by the time you learn how to do the one liners, t... muad dib peoples thoughts https://muaddibspace.blogspot.com/2009/02/agda-supports-eta-cont-is-monad.html Muad`Dib: Agda Supports Eta - Cont is a monad Since Agda 2 now supports eta in the definitional equality, here is a celebratory proof that Cont is a monad! module eta where data _=... muad dib agda supports eta cont https://muaddibspace.blogspot.com/2009/01/ Muad`Dib: January 2009 muad dib january https://muaddibspace.blogspot.com/2010/ Muad`Dib: 2010 muad dib https://muaddibspace.blogspot.com/2009/ Muad`Dib: 2009 muad dib https://muaddibspace.blogspot.com/2009/03/how-to-halve-number.html Muad`Dib: How to halve a number (* * How to halve a number * --------------------- *) (* (* just so we start on the same page, what is a number? *) * * Inductive nat ... muad dib how to halve number https://muaddibspace.blogspot.com/2008/12/dependently-typed-datadynamic.html Muad`Dib: Dependently typed Data.Dynamic muad dib typed data dynamic https://muaddibspace.blogspot.com/2009/04/strongly-specified-parser-combinators.html Muad`Dib: Strongly Specified Parser Combinators Following the approach Wouter Swierstra used for Hoare State Monad , we define a Parser monad with pre and post conditions that express soun... muad dib strongly parser combinators https://muaddibspace.blogspot.com/2008/06/pure-type-systems-type-checker-in.html Muad`Dib: Pure Type Systems type checker in Prolog They ( http://people.cs.uu.nl/andres/LambdaPi/index.html http://augustss.blogspot.com/2007/10/simpler-easier-in-recent-paper-simply.html ) s... muad dib type systems pure checker prolog https://muaddibspace.blogspot.com/2010/02/ Muad`Dib: February 2010 muad dib february https://muaddibspace.blogspot.com/2008/08/tail-calls-dont-exist-so-why-look-for.html Muad`Dib: Tail calls don't exist - So why look for them? muad dib tail calls https://muaddibspace.blogspot.com/2008/08/unscrambling-without-prolog.html Muad`Dib: Unscrambling without Prolog Inductive Bit : Set := H | V | TL | TR | BL | BR. Definition State := (Bit * Bit * Bit * Bit * Bit * Bit * Bit * Bit)%typ... muad dib unscrambling without prolog https://muaddibspace.blogspot.com/2009/10/short-note-on-semantics.html Muad`Dib: Short Note on Semantics With all curious derivations that come from the forests of To Mock a Mockingbird, and in the intrests of deepening understanding of type the... muad dib short note semantics https://muaddibspace.blogspot.com/2008/07/ Muad`Dib: July 2008 muad dib july https://muaddibspace.blogspot.com/2008/09/fin-is-injective.html Muad`Dib: Fin is injective muad dib fin injective https://muaddibspace.blogspot.com/2008/10/coq-extension.html Muad`Dib: Coq Extension muad dib coq extension https://muaddibspace.blogspot.com/2008/11/type-error.html Muad`Dib: Type Error muad dib type error https://muaddibspace.blogspot.com/2009/02/universes-for-discrimination-proofs.html Muad`Dib: Universes for discrimination proofs I can't decide if this is trivial or not. What does this construction mean/say? module Universe where data N0 : Set where data Bo... muad dib universes discrimination proofs https://muaddibspace.blogspot.com/2008/10/unprogramming-permutation-machine-stack.html Muad`Dib muad dib https://nagamakironin.blogspot.com/2013/09/recommendations-calvin-and-muaddib.html Mock Ramblings: Recommendations: Calvin and Muad'Dib A friend of mine posted a link to this on Facebook, and it's amazing how well the dialogue works when you plug it into old Calvin and Hobbes... mock ramblings recommendations calvin muad