This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This is my short-ish tutorial on how to implement closures in | |
a simple functional language: Foo. | |
First, some boilerplate. | |
> {-# LANGUAGE DeriveFunctor, TypeFamilies #-} | |
> import Control.Applicative | |
> import Control.Monad.Gen | |
> import Control.Monad.Writer | |
> import Data.Functor.Foldable |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{------------------------------------------------------------------------------ | |
reactive-banana | |
Implementation of an "industry strength" game loop with fixed time step | |
and variable fps. | |
See also http://gafferongames.com/game-physics/fix-your-timestep/ | |
-------------------------------------------------------------------------------} | |
{-# LANGUAGE NoMonomorphismRestriction #-} | |
module Main where |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Simple JavaScript tokenizer (not a full parser!!!) | |
* | |
* Portions taken from Narcissus by Brendan Eich <[email protected]>. | |
*/ | |
/*jshint evil: true, regexdash: false, regexp: false */ | |
var KEYWORDS = [ | |
'break', |