Icelandjack

wip, spin-off gists: https://gist.github.com/Icelandjack/e42495341f6029aad8c7e4e4a12c34ce

Monad gives Applicative, Applicative etc. gives Num, Floating, Fractional (regardless of actual subclass relationship)

Setting it up

WrapMonad tells us that a Monad implies Functor, Applicative

instance Monad m => Functor     (WrappedMonad m)

tonymorris

import java.util.function.Function;
import java.util.function.BiFunction;
import java.util.Scanner;

abstract class TerminalOperation<A> {
  // this ensures that there are no subclasses of TerminalOperation
  // outside of this class
  private TerminalOperation() {

  }

bellbind

# -*- mode: python -*-
{
    "targets": [
        {
            "include_dirs": ["<!(node -e \"require('nan')\")"],
            "target_name": "TimerAndPromise",
            "sources": [
                "timer-and-promise.cc"
            ],
            "conditions": [

stelleg

Sometimes it would be nice if a type system could automatically "do it's best"
to restrict what a value will be. For example, the type `Bool` is the compiler
saying the value will either be `True` or `False`, but it doesn't know which.
What we want is the compiler to be able to be precise when possible, so instead
of always saying `Bool` (or "I don't know"), it could say `True`, `False`, or
`Bool`. This gist shows how Hindley Milner already has this capability that can
be exercised by using Church or Scott encodings of simple data types.

> {-# LANGUAGE RankNTypes #-}
> import qualified Data.Maybe as M

lalinsky

def format_time(secs):
    return "%d:%02d" % (secs / 60, secs % 60)


def invert(arr):
    """
    Make a dictionary that with the array elements as keys and
    their positions positions as values.

    >>> invert([3, 1, 3, 6])

leepike

--
-- Play a song and flash LEDs on alternate notes.
-- Lee Pike <lee pike @ gmail . com> (remove spaces)
-- See http://leepike.wordpress.com/?p=427
-- BSD3 License
-- 
-- Note timing issues: http://www.arduino.cc/en/Tutorial/PlayMelody
--

module CopilotSing where