lambda-fairy

/// Shunting-yard regex parser


#[derive(Debug)]
pub enum Token {
    Empty,
    Lit(char),
    Op(Op)
}

lambda-fairy

#[allow(dead_code)];

mod parse;

/*
AAAAAAAAA
AAAAAAAAAAA
AAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA

lambda-fairy

# Grammar for the algorithmic language Pinkie

block = (stmt (nl stmt)*)?

stmt
    = name space "=" space expr
    / expr

expr = atom (space atom)*

lambda-fairy

module Stuff where

-- False is defined as a type with no values.
data ⊥ : Set where -- empty

-- Not-A is defined as A implying false.
¬ : Set → Set
¬ A = A → ⊥

-- Double negation.  Some theorems in classical logic are not provable in

lambda-fairy

Pinkie bikeshedding

Property syntax

Lookup

obj.prop

lambda-fairy

/* This program is not valid C. */

#include <stdio.h>

int main() {
    puts("Hello, world!");
    return 0;
}

lambda-fairy

That's hotter than an iron refinery.

Your reasoning is tighter than a whore on her first night.

Sexy, sexy non sequitur.

If a crystal grows to exactly 1609.344 meters in length... is it a milestone?

You shoot yourself in the foot, but the compiler notices you're already dead inside and optimizes it away.

lambda-fairy

module Sleepsort (sleepsort) where

import Control.Applicative
import Control.Concurrent
import Control.Monad
import System.IO.Unsafe (unsafeInterleaveIO)

sleepsort :: [Int] -> IO [Int]
sleepsort xs = do
    ronald <- newChan

lambda-fairy

jQuery.fn.extend({
    fuzzyCheckboxes: function (selector) {
        this.on('click', selector, function () {
            $(this).find(':checkbox').click()
            })
        this.on('click', selector + ' :checkbox', function (e) {
            e.stopPropagation()
            })
        }
    })

lambda-fairy

#!/usr/bin/env python3

from functools import wraps

def fix(f):
    @wraps(f)
    def inner(*args, **kwds):
        return f(fix(f), *args, **kwds)
    return inner