takoeight0821

.intel_syntax noprefix
.text
not:
	ret
f:
	call not
	ret

# 以下ログ
# Stack dump:

takoeight0821

#include <stdlib.h>
#include <stdbool.h>
#include <stdio.h>
#include <gc.h>
#include <stdint.h>

struct value;

struct env
{

takoeight0821

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <gc.h>

union value;
struct env;
struct closure;
union value;

takoeight0821

const Discord = require('discord.js');

function getRandomInt(min, max) {
    min = Math.ceil(min);
    max = Math.floor(max);
    return Math.floor(Math.random() * (max - min)) + min; //The maximum is exclusive and the minimum is inclusive
}

function diceRoll(count, roll) {
    let dices = [];

takoeight0821

#include <iostream>
#include <tuple>
#include <algorithm>
#include <vector>

using namespace std;

template <typename T>
unsigned int digit_sum(T x, unsigned int base) {
  auto result = 0;

takoeight0821

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_LEN 256

typedef struct stack {
    int *stack;
    int len;
} Stack;

takoeight0821

module AstDsl where

import Control.Monad.State
import Control.Monad.Identity
import Data.Monoid
import Control.Monad.Writer

-- こんな普通のAST定義があるとする
data Expr = Let String Expr Expr
          | Var String

takoeight0821

(* 普通の再帰で書いたfibと、末尾再帰のfibが等しいことをCoqで証明
   http://www.madsbuch.com/blog/100-days-of-fibonacci-day-7-coq/
   を参考にした。
 *)
From mathcomp Require Import ssreflect.all_ssreflect.

Fixpoint fib1 (n : nat) : nat :=
  match n with
  | 0 => 0
  | 1 => 1

takoeight0821

data T = A | B | C T
  deriving (Show, Eq)

class HasT a where
  t :: a -> T

instance HasT T where
  t = id

instance HasT a => HasT (Maybe a) where

takoeight0821

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <limits.h>

#define EMPTY 0
#define BLACK 1
#define WHITE 2
#define OUTER 3