git clone [email protected]:YOUR-USERNAME/YOUR-FORKED-REPO.git
cd into/cloned/fork-repo
git remote add upstream git://github.com/ORIGINAL-DEV-USERNAME/REPO-YOU-FORKED-FROM.git
git fetch upstream
git clone [email protected]:YOUR-USERNAME/YOUR-FORKED-REPO.git
cd into/cloned/fork-repo
git remote add upstream git://github.com/ORIGINAL-DEV-USERNAME/REPO-YOU-FORKED-FROM.git
git fetch upstream
This is the first post of a series about Algebraic Effects and Handlers.
There are 2 ways to approach this topic:
Both approaches are valuables and give different insights on the topic. However, not everyone (including me), has the prerequisites to grasp the concepts of Category theory and Abstract Algebra. On the other hand, the operational approach is accessible to a much wider audience of programmers even if it doesn't provide the full picture.
set mouse= | |
set nomodeline | |
set tabstop=2 shiftwidth=2 expandtab | |
" Show tabs. | |
set list listchars=tab:>\ | |
set linebreak | |
set ignorecase wildignorecase | |
set undofile | |
set splitright |
# | |
# ~/.bashrc | |
# | |
# If not running interactively, don't do anything. | |
[[ $- != *i* ]] && return | |
shopt -s histappend | |
HISTSIZE='' | |
HISTFILESIZE='' |
#!/usr/bin/env python3 | |
from fugashi import Tagger | |
import re | |
import sys | |
# Japanese card creation process | |
# - Word list on Google Keep | |
# - Find phrase and add to a temporary file | |
# - Create cards and add it to `Stage 0` deck |
#include <X11/Xlib.h> | |
#include <X11/Xatom.h> | |
#include <X11/Xutil.h> | |
#include <stdlib.h> | |
#include <stdio.h> | |
#include <stdbool.h> | |
#include "x.h" | |
#include "datatypes.h" |
The originality of these Gists varies drastically. Most are inspired by the work of others, in that case, all merit goes to the original authors. I have linked everything used as reference material on the Gists themselves.
In this video we come across about 50 online resources for category theory:
I quickly comment on about 20 major ones. I link to the university sites, arXiv sites or Amazon page - most of the mentioned books are online available.
Here's another category theory list on github
Datatypes in the Formality programming language are built out of an unusual
structure: the self-type. Roughly speaking, a self-type is a type that can
depend or be a proposition on it's own value. For instance, the consider the
2 constructor datatype Bool
:
import control.bifunctor | |
import data.multiset.basic | |
import tactic | |
example {α} {x : α} {xs : multiset α} : {x} ≤ x :: xs := | |
begin | |
rw multiset.singleton_eq_singleton, | |
apply multiset.cons_le_cons, | |
apply zero_le, | |
end |