XVilka

THIS GIST WAS MOVED TO TERMSTANDARD/COLORS REPOSITORY.

PLEASE ASK YOUR QUESTIONS OR ADD ANY SUGGESTIONS AS A REPOSITORY ISSUES OR PULL REQUESTS INSTEAD!

steshaw

1. http://pragprog.com/magazines/2012-08/thinking-functionally-with-haskell
2. http://pragprog.com/magazines/2012-09/thinking-functionally-with-haskell
3. http://pragprog.com/magazines/2012-10/thinking-functionally-with-haskell
4. http://pragprog.com/magazines/2012-11/thinking-functionally-with-haskell
5. http://pragprog.com/magazines/2012-12/web-programming-in-haskell
6. http://pragprog.com/magazines/2013-01/web-programming-in-haskell-part-ii
7. http://pragprog.com/magazines/2013-03/uncle-bob-and-functional-programming
8. http://pragprog.com/magazines/2013-04/dependent-types
9. http://pragprog.com/magazines/2013-05/dependent-types-part-ii
10. http://pragprog.com/magazines/2013-06/unification

Zolmeister

--
-- xmonad example config file.
--
-- A template showing all available configuration hooks,
-- and how to override the defaults in your own xmonad.hs conf file.
--
-- Normally, you'd only override those defaults you care about.
--

import XMonad

cartazio

{-# LANGUAGE GADTs, Rank2Types, KindSignatures, ScopedTypeVariables, TypeOperators, DataKinds, PolyKinds, MultiParamTypeClasses, FlexibleInstances, TypeFamilies, DoRec, ExtendedDefaultRules #-}
import Control.Applicative
import Control.Category
import Control.Comonad
import Control.Monad.Fix
import Control.Monad (ap)
import Data.Functor.Identity
import Data.Typeable
import Data.Monoid
import Data.Unique

markhibberd

Overview

There are lots of representations for strings. In most languages they pick one set of tradeoffs and run with it. In haskell the "default" implementation (at least the one in the prelude) is a pretty bad choice, but unlike most other languages (really) good implementations exist for pretty much every way you can twist these things. This can be a good thing, but it also leads to confusion, and frustration to find the right types and how to convert them.

Types

DmitrySoshnikov

/**
 * Automatic Reference Counting (ARC) Garbage Collection technique.
 *
 * This diff describes Reference counting GC technique.
 * See also previous lesson on Mark and Sweep GC:
 * https://gist.github.com/4391763
 *
 * by Dmitry Soshnikov <[email protected]>
 * MIT Style License
 */

paulp

Hello scala, my old friend
I've come to take you home again
Because a feature slowly creeping
left me plagued with doubts and weeping
and the version that was tagged in the repo
just has to go
it lacks the signs of soundness

On sleepless nights I hacked alone
applying ant and other tools of stone

mark-sweep-gc.js

/**
 * Mark and Sweep Garbage Collection technique.
 * MIT Style License
 * by Dmitry Soshnikov
 */

// This diff describes the simplest version of mark and sweep
// GC in order to understand the basic idea. In real practice the
// implementation can be much tricker and more optimized.

paulmillr

# Algorithm W (Damas-Hindley-Milner) in LiveScript.
# By Paul Miller (paulmillr.com), Public domain.
#
# Based on Robert Smallshire's [Python code](http://bit.ly/bbVmmX).
# Which is based on Andrew's [Scala code](http://bit.ly/aztXwD).
# Which is based on Nikita Borisov's [Perl code](http://bit.ly/myq3uA).
# Which is based on Luca Cardelli's [Modula-2 code](http://bit.ly/Hjpvb).
# Something like that.

prelude = require './prelude'

agentgt

package com.snaphop.util;


/*
 * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//httpclient/src/java/org/apache/commons/httpclient/util/URIUtil.java,v 1.27 2004/05/05 20:34:01 olegk Exp $
 * $Revision: 507321 $
 * $Date: 2007-02-14 01:10:51 +0100 (Wed, 14 Feb 2007) $
 *
 * ====================================================================
 *