Heimdell

Система типов: если есть нечто, что можно представить структурой и выразить через типы - do it.

> newtype End  = End  (Request -> Maybe Request)
> newtype Node = Node (Request -> Maybe Request)

> Node granny // Node mom = Node (mom <=< granny)
> Node mom    /> End  son = End  (son <=< mom)

> End left \/ End right = End (left `orelse` right)

Heimdell

{-# LANGUAGE RecordWildCards #-}

import Control.Monad

{- 
  Later, `Class {..}` will autobind all attributes to their names
  in the field of visibility
-}
data Structure = Class   { name      :: String 
                         , abilities :: Structure

Heimdell

import System.Environment
import System.IO
import System.Directory
import Data.String.Utils
import Control.Monad


main = do places <- getArgs
          let place = if places == [] 

Heimdell

{-# Language RecordWildCards #-}

module TaskGen where

import Control.Monad

data Task = Task { combos      :: [String]
                 , description ::  String
                 , actions     :: [String]

Heimdell

{-# LANGUAGE FunctionalDependencies,
             FlexibleInstances       #-}

module Parser where

import Control.Monad

newtype Parser e s a = Parser { runParser :: s -> Either (Error e s) (a, s) }

data Error a b = Error a String b deriving Show

Heimdell

-module (llist).

-compile(export_all).

unfold(X, F) ->
  case F(X) of
    {ok, X1} -> [X1 | fun() -> unfold(X1, F) end];

    false    -> []
  end.

Heimdell

module FlashHelper

  [:success, :info].each do |kind|
    define_method "flash_#{kind}" do |options = {}|
      msg = options[:message] || kind
      flash_notice message: msg, kind: kind, now: options[:now]
    end
  end

  def flash_error(options = {})

Heimdell

module Adapter where

import qualified Data.Map as Map

_create :: Ord k => k -> v -> Map k v -> Map k v
_create = Map.insert

_update :: Ord k => k -> v -> Map k v -> Map k v
_update = Map.insert

Heimdell

int main(int argc, char *argv[]) {
    int count = 10, silent = 0;
    char * command = 0;

    char letter;
    while ((letter = getopt_long(argc, argv, "n:c:s")) != -1) {
        switch (letter) {
        case 'n':
            count = atoi(optarg);
            break;

Heimdell

import Data.List
import System.Environment
import System.IO
import System.Directory
import Data.String.Utils hiding (join)
import Control.Monad

import System.FilePath.Posix