Skip to content

Instantly share code, notes, and snippets.

Keybase proof

I hereby claim:

  • I am gfngfn on github.
  • I am gfngfn (https://keybase.io/gfngfn) on keybase.
  • I have a public key ASB3NT2MJbBm8rowUBm9bYWfAott0uEMhHdDLl4n08StIQo

To claim this, I am signing this object:

Integration Tests for Operation-based Conversion of BIRDS

This is an operation check of the implementation given as 10ab5fd in the following PR:

Note 1: The tests below actually use 6dfa1d3 in the following PR, where the newly added feature can be used via CLI:

signature S_A =
sig
type u (* 外部から与えられる *)
type t
val f : t -> u * t
end
signature S_B =
sig
type t (* 外部から与えられる *)
@require: pervasives
@require: gr
module SaitoParen : sig
direct \saito-open : [math; math] math-cmd
end = struct
let half-length hgt dpt hgtaxis fontsize =
\documentclass{jsarticle}
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\makeatletter
\def\local@originalLessThan{<}
\catcode`\<=13\relax
\def<{\futurelet\local@temp@nextToken\local@lessThanI}
\def\local@lessThanI{%
\ifx=\local@temp@nextToken\relax
\def\local@temp@nextCommand##1{\futurelet\local@temp@nextToken\local@lessThanII}%
@gfngfn
gfngfn / draw_setfamily.ml
Created December 16, 2015 20:24
A spaghetti code for generating Hasse diagram of the powerset of n element.
type index = int
type height = int
type order = int
(* ---- basic calc ---- *)
let rec pow2 n =
if n <= 0 then 1 else 2 * (pow2 (n - 1))