pasberth

Theorem Modus_ponens: forall (P Q: Prop), (P -> Q) -> P -> Q.
Proof.
  intro P.
  intro Q.
  intro H.
  apply H.
Qed.

pasberth

import qualified System.Environment     as E
import qualified Data.HashMap.Strict    as M

mathematicalScriptMap :: M.HashMap Char Char
mathematicalScriptMap = M.fromList [
    ('A', '\x1D49C'),
    ('B', '\x0212C'),
    ('C', '\x1D49E'),
    ('D', '\x1D49F'),
    ('E', '\x02130'),

pasberth

# -*- coding: utf-8 -*-

s = gets.chomp

if s == "true" || s == "真" then
  puts "OK"
else
  puts "NG"
end

pasberth

def random
  [true, false].sample
end

if random then
  puts "OK"
else
  puts "NG"
end

pasberth

--ちんちんっぽいことするやつ
import System.Random
chimpo :: String -> IO String
randomString :: String -> IO String

chimpo c = do s <- randomString c
              if take 4 c == "ABCDE"
		 then return $ c ++ ("なんか終わりました" ++ (show (length c )))
		 else chimpo s

pasberth

lazy = (x) -> () -> x
thaw = (x) -> x()
app = () -> [].slice.call(arguments, 0).reduce (x, y) -> () -> thaw(x)(y)

S = (x) -> (y) -> (z) -> thaw app(x, z, app(y, z))
K = (x) -> (y) -> thaw x
I = (x) -> thaw x

parseLazyK = (source) ->
  stack = [[]]

pasberth

$ ./bin/coffee --js < a.coffee

Cannot read property 'args' of undefined

pasberth

USE_OCAMLFIND = true

OCAMLPACKS[] =
  llvm

FILES[] =
  types
  lambda
  parser
  lexer

pasberth

#! bin/bash
MANSECT="1 2 3 4 5 n"
for i in $MANSECT
do
	echo 'aaa'
done

# aaa
# aaa
# aaa

pasberth

{-# LANGUAGE GADTs                  #-}
{-# LANGUAGE ExplicitForAll         #-}
{-# LANGUAGE ScopedTypeVariables    #-}
{-# LANGUAGE MultiParamTypeClasses  #-}
{-# LANGUAGE FlexibleInstances      #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE UndecidableInstances   #-}

module Main where