First, ensure the following tools are available on the local system and reasonably up to date:
- Git
- Git-flow
- RVM
- Bash
- SSH
| Fish f | |
| ⍝ Variables | |
| ⎕IO←0 ⍝ Arrays start with 0 | |
| S←⍬ ⍝ This will hold the stack(s) | |
| i←'' ⍝ This is an input buffer | |
| s←,0 ⍝ This will hold the markers for [ and ], the first stack is at pos 0. | |
| D←4 2⍴D,⌽D←0 1 0 ¯1 ⍝ Directions | |
| p←0 0 ⍝ Position (start at 0,0) | |
| v←0 ⍝ This is set to 1 when reading a string |
| import java.awt.Point; | |
| import java.util.*; | |
| public abstract class AbstractLattice implements Tiling<AbstractLattice.LatticeCell> { | |
| // Use the idea of expansion and vertex mapping from my earlier aperiod tiling implementation. | |
| private Map<Point, Set<LatticeCell>> vertexNeighbourhood = new HashMap<Point, Set<LatticeCell>>(); | |
| private int scale = -1; | |
| // Geometry | |
| private final int dx0, dy0, dx1, dy1; |
| package self.vpalepu.stackoverflow; | |
| import java.io.File; | |
| import java.io.FileInputStream; | |
| import java.io.IOException; | |
| import org.objectweb.asm.ClassReader; | |
| import org.objectweb.asm.ClassVisitor; | |
| import org.objectweb.asm.ClassWriter; | |
| import org.objectweb.asm.MethodVisitor; |
| import random | |
| import sys | |
| import argparse | |
| #Characters | |
| superscript = [ | |
| "\u030d", "\u030e", "\u0304", "\u0305", "\u033f", | |
| "\u0311", "\u0306", "\u0310", "\u0352", "\u0357", | |
| "\u0351", "\u0307", "\u0308", "\u030a", "\u0342", | |
| "\u0343", "\u0344", "\u034a", "\u034b", "\u034c", |
| #!/bin/bash | |
| # bash generate random 5 character string) | |
| cat /dev/urandom | tr -dc 'a-z' | fold -w 5 | head -n 1 |
| /* Compile with: g++ -Wall –Werror -o shell shell.c */ | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #include <ctype.h> | |
| #include <unistd.h> | |
| #include <sys/types.h> | |
| #include <sys/wait.h> |
| let eval str = | |
| let cells = Array.make 4096 0 in | |
| let ptr = ref 0 in | |
| let len = String.length str in | |
| let rec evalbf c = | |
| if c >= len then | |
| c | |
| else | |
| match String.get str c with |
| Title | Author(s) | Year |
|---|---|---|
| Intuitionistic Type Theory | Per Martin-Löf | 1984 |
| On the Meanings of the Logical Constants and the Justification of the Logical Laws | Per Martin-Löf | 1996 |
| [[http://mat.uab.cat/~kock/crm/h |