quickdudley

Keybase proof

I hereby claim:

• I am quickdudley on github.
• I am jeremy_list (https://keybase.io/jeremy_list) on keybase.
• I have a public key ASDRamhfOW_zIys8PlETnr8eFosoxhN51kbeibQij9czbwo

To claim this, I am signing this object:

quickdudley

" An example for a vimrc file.
"
" Maintainer:	Bram Moolenaar <Bram@vim.org>
" Last change:	2019 Dec 17
"
" To use it, copy it to
"	       for Unix:  ~/.vimrc
"	      for Amiga:  s:.vimrc
"	 for MS-Windows:  $VIM\_vimrc
"	      for Haiku:  ~/config/settings/vim/vimrc

quickdudley

{-# LANGUAGE FlexibleInstances, OverloadedStrings #-}
module Main where

import Data.List
import qualified Data.Map as M
import Data.IORef
import System.Random
import System.Directory
import Control.Monad
import Control.Concurrent

quickdudley

This Gist confirms the Linked Identity in my OpenPGP key, and links it to this GitHub account.

Token for proof:
[Verifying my OpenPGP key: openpgp4fpr:06e3799a19f5abc6af0cc5092fb4463dfc98dc97]

quickdudley

My favourite Minecraft settings (so far)

• World type: large biomes

• World seed: -13510810358

• Spawn point moved from x:-633, y:64, z:-964 to x:38, y:65, z:0 using NBT editor

• Survival mode, cheats disabled

quickdudley

{-# LANGUAGE NoMonomorphismRestriction #-}

import Text.ParserCombinators.Parsec
import Text.ParserCombinators.Parsec.Token hiding (parens)
import Text.ParserCombinators.Parsec.Expr
import Control.Applicative hiding ((<|>))
import Control.Monad
import Prelude hiding (not)

data Expr = Not Expr | And Expr Expr | Or Expr Expr | Var Char | SubExpr Expr deriving Eq

quickdudley

0 REM Prints the lyrics of the famous song:
0 REM http://www.99-bottles-of-beer.net/
(0 - 50) REM printing subroutine
(0 - 49) LET rf%(sh%) = (0 - 41)
(0 - 45) PRINT beer%;: PRINT " ";
((0 - 44) * (1 - ((beer% - 1) / (beer% - 1)))) PRINT "bottle";
(0 - 44) PRINT "bottles";
(0 - 42) PRINT " of beer";
10 LET beer% = 99
12 LET loop% = 90

quickdudley

{-
My implementation of http://catseye.tc/node/SICKBAY
By Jeremy List
Public domain
-}

import qualified Data.Map as M
import Data.Maybe
import Data.List
import Data.IORef

quickdudley

import Control.Applicative
import Control.Monad
import Data.List
import Data.Function (on)
import Data.Ratio
import Data.Char

newtype P a = P {probabilities :: [(Rational,a)] }

instance Functor P where