gafferongames.com
Gaffer on Games | Integration Basics
http://gafferongames.com/game-physics/integration-basics
August 25, 2016. UDP vs. TCP. Sending and Receiving Packets. Virtual Connection over UDP. Reliability, Ordering and Congestion Avoidance over UDP. What every programmer needs to know about game networking. Introduction to Virtual Go. The Shape Of The Go Stone. Tessellating The Go Stone. How The Go Stone Moves: Rigid Body Dynamics. Collision Detection: Go Stone vs. Go Board. Rotation and Inertia Tensors. Collision Response And Coulomb Friction. Introduction to Networked Physics. Reading and Writing Packets.
leeduhem.wordpress.com
Understanding Functions Which Use ‘instance Monad []’ by Equational Reasoning | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/06/19/understanding-functions-which-use-list-monad-by-equational-reasoning
Everything About Mathematics, Functional Programming, and Haskell. Understanding Functions Which Use ‘instance Monad []’ by Equational Reasoning. Leave a comment ». GüŸnther Schmidt asked in Haskell-Cafe how to get a stream like this. A, … , z, aa, … , az, ba, … , bz, … ]. Answer 1 (by Matthew Brecknell). Concat $ tail $ iterate (map (:) [‘a’ . ‘z’] * ) ]. Well, how does this expression do what we want? Concat, tail, iterate, map, are easy, looks like the magic is in ( * ). 8212; Lift a value. M1 = x1 -.
leeduhem.wordpress.com
Finish reading of The Typeclassopedia | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/05/30/finish-reading-of-the-typeclassopedia
Everything About Mathematics, Functional Programming, and Haskell. Finish reading of The Typeclassopedia. Leave a comment ». Finish reading of The Typeclassopedia from The Monad.Reader 13. But it’s just the beginning of a series of reading about papers, articles, wikibooks, blog posts, and codes, as the author. It’s a great article, talks about Haskell’s type class and their relationship, has plenty of very useful references. Written by Lee Duhem. May 30, 2009 at 11:27 am. Leave a Reply Cancel reply.
leeduhem.wordpress.com
Partition An Integer n to an arithmetic series | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/07/12/partition-an-integer-n-to-an-arithmetic-series
Everything About Mathematics, Functional Programming, and Haskell. Partition An Integer n to an arithmetic series. Leave a comment ». Give a positive integer n, generate all partition of n to an arithmetic series with common difference 1. First, a straightforward solution:. Second, a not so straightforward solution, but much more effective than the first:. You can check these two solutions are equal (upto n) by. Exercise: Prove solution two is right. We’ll prove it by three steps. To prove this, we only ...
leeduhem.wordpress.com
Sieve of Eratosthenes In Haskell | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/05/20/sieve-of-eratosthenes-in-haskell
Everything About Mathematics, Functional Programming, and Haskell. Sieve of Eratosthenes In Haskell. Leave a comment ». Algorithm description, see Sieve of Eratosthenes. Module Main where import System.Environment isPrime p (x:xs) x*x p = True p `mod` x = 0 = False otherwise = isPrime p xs primes = 2 : oprimes where oprimes = 3 : [ p p - [5,7.], isPrime p oprimes] main = do args - getArgs let n = read $ args! 0 x = takeWhile ( n) primes print $ length x print x. There is a HackageDB package called primes.
leeduhem.wordpress.com
Finish reading of FP Implementation | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/06/02/finish-reading-of-fp-implementation
Everything About Mathematics, Functional Programming, and Haskell. Finish reading of FP Implementation. Leave a comment ». Finish reading of The Implementation of Functional Programming Languages. By Simon Peyton Jones. Written by Lee Duhem. June 2, 2009 at 4:28 pm. Posted in Functional Programming. Laquo; Finish reading of The Typeclassopedia. Understanding ‘instance Monad ( - ) r)’ by type inference. Leave a Reply Cancel reply. Enter your comment here. Address never made public).
leeduhem.wordpress.com
Understanding ‘instance Monad ((->) r)’ by type inference | Control.Monad.Reader
https://leeduhem.wordpress.com/2009/06/07/understanding-monad-instance-by-type-inference
Everything About Mathematics, Functional Programming, and Haskell. Understanding ‘instance Monad ( - ) r)’ by type inference. While reading source code of Control.Monad.Instances. I found I can’t understand ‘instance of Monad ( - ) r)’, but after read Brent Yorgey’s reply. In his blog post about The Typeclassopedia. He said, ‘the data constructor for (- ) is called lambda’, I suddenly found I CAN understand them by type inference. Here is how I do these. There are two points:. Return : (Monad m) = a - m a.
