forki

// Mimic type classes with additional param

type 'a Num = {
    zero: 'a
    add: 'a -> 'a -> 'a
    mult: 'a -> 'a -> 'a
    fromInteger: int -> 'a }

let intNum = {
    zero = 0

jvranish

{-# LANGUAGE Rank2Types
           , RebindableSyntax
           , ImplicitParams
           , NoMonomorphismRestriction #-}

import Data.Maybe
import Data.Function
import Data.String
import Prelude (undefined, error, String, (++))

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

tonymorris

using System;
using System.Collections;
using System.Collections.Generic;

/*
A basic lens library for the purpose of demonstration.
Implements a lens as the costate comonad coalgebra.

This library is not complete.
A more complete lens library would take from

pthariensflame

The Indexed State Monad in Haskell, Scala, and C#

Have you ever had to write code that made a complex series of succesive modifications to a single piece of mutable state? (Almost certainly yes.)

Did you ever wish you could make the compiler tell you if a particular operation on the state was illegal at a given point in the modifications? (If you're a fan of static typing, probably yes.)

If that's the case, the indexed state monad can help!

Motivation

pthariensflame

The Indexed Continuation Monad in Haskell, Scala, and C#

The indexed state monad is not the only indexed monad out there; it's not even the only useful one. In this tutorial, we will explore another indexed monad, this time one that encapsulates the full power of delimited continuations: the indexed continuation monad.

Motivation

The relationship between the indexed and regular state monads holds true as well for the indexed and regular continuation monads, but while the indexed state monad allows us to keep a state while changing its type in a type-safe way, the indexed continuation monad allows us to manipulate delimited continuations while the return type of the continuation block changes arbitrarily. This, unlike the regular continuation monad, allows us the full power of delimited continuations in a dynamic language like Scheme while still remaining completely statically typed.

ismell

Ubuntu Upstart Script for Team City

1. Install TeamCity.conf and TeamCityAgent.conf in /etc/init/

2. Create TeamCity in /etc/default/TeamCity

3. Make sure TEAMCITY_DATA_PATH and TEAMCITY_SERVER_PATH are owned by www-data

4. Start TeamCity

    sudo service TeamCity start
   

plentz

# to generate your dhparam.pem file, run in the terminal
openssl dhparam -out /etc/nginx/ssl/dhparam.pem 2048

vendethiel

macro $do {
    rule { { $y:expr } } => {
        $y
    }
    rule { { $x:ident <- $y:expr $rest ... } } => { 
        λ['>=']($y, function($x) {
            return $do { $rest ... }
        });
    }
}

gelisam

-- in reply to http://www.reddit.com/r/haskell/comments/21mja6/make_lllegal_state_transitions_unrepresentable/
-- 
-- We implement a tiny language with three commands: Open, Close, and Get.
-- The first Get after an Open returns 1, the second Get returns 2, and so on.
-- 
-- Get is only valid while the state is open, and
-- Open must always be matched by a Close.
-- We enforce both restrictions via the type system.
-- 
-- There are two valid states: Opened and Closed.