frodo821

frodo821

from abc import ABC, abstractmethod


class Proposition(ABC):
  def __and__(self, other):
    return CompositeProposition('and', self, other)

  def __or__(self, other):
    return CompositeProposition('or', self, other)

frodo821

\documentclass[a4paper,11pt]{jsarticle}
\usepackage{amsmath,amsfonts}
\usepackage{bm}
\usepackage[dvipdfmx]{graphicx}
\usepackage{amsthm}
\usepackage{ascmac}

\newtheorem*{definition}{定義}
\newtheorem*{axiom}{公理}
\newtheorem*{theorem}{定理}

frodo821

# コンピュータに愛を囁いてもらえる……かもしれない

def formula(x, y):
    return x**2 + (y - (x**2)**(1/3))**2

def draw_char(x, y, point='*', space=' '):
    return point if abs(formula(x, y) - 12) < 2 else space

def draw():
    print('\n'.join(''.join(draw_char((y - 20) / 5, (x - 15) / 2) for y in range(0, 40)) for x in range(0, 30)[::-1]))

frodo821

from abc import ABC, abstractmethod as abstract

class AbstractMapping(ABC):
  @abstract
  def __iter__(self):
    """
    return an iterator or iterable denotes mapping keys
    """
    yield from []

frodo821

from functools import wraps
from inspect import signature

def carry(func):
  """
  carrying most of functions, methods or built-in functions.
  """
  params = [*signature(func).parameters.items()]
  if any(map(lambda x: x[1].kind&1 == 0, params)):
    raise ValueError('Undeterminable length of varargs was declared.')

frodo821

function* monteCarlo() {
  let it = 0;
  let prev = 0;
  while (true) {
    prev = prev * it / (it + 1) + (Math.random() ** 2 + Math.random() ** 2 < 1 ? 1 / (it + 1) : 0);
    it++;
    const res = prev * 4;
    yield { current: res, iterations: it, diff: Math.PI - res };
  }
}

frodo821

interface Conditional<T> {
  then: (expr: () => T) => Conditional<T>;
  fail: (expr: () => T) => Conditional<T>;
  result: () => T | undefined;
}

export default function cond<T>(condition: boolean): Conditional<T> {
  let res: T | undefined;

  return {

frodo821

Require Import List.
Import ListNotations.

Fixpoint reversed { A: Type } (xs: list A) :=
  match xs with
  | nil => nil
  | x :: xs' => reversed xs' ++ [x]
end.

Lemma reversed_sub: 

frodo821

from re import match

def validateEmail(email):
  valid = 'abcdefghijklmnopqrstuvwxyz1234567890!#$%&\'*+-/=?^_`{}|~'
  if not email:
    return False
  email = email.lower()
  if email.startswith('"'):
    i = 1
    while i < min(64, len(email)):