Translated to Markdown from this ancient TeX file. I’m not sure who made the original.
Hover over a link to see the place structure. Click it to view gismu info on Wiktionary.
girzu
(group)
Translated to Markdown from this ancient TeX file. I’m not sure who made the original.
Hover over a link to see the place structure. Click it to view gismu info on Wiktionary.
girzu
(group)This is a brief introduction to Lojban, a constructed human language. It has a very nice, fun, regular grammar that computers and humans alike can understand easily.
All Lojban words are either particles (tiny words that help the grammar) or verbs (which tell us how nouns relate).
A Lojban sentence consists of a main verb with a bunch of nouns plugged into it.
A Lojban verb definition looks like this:
var soundex = function (s) { | |
var a = s.toLowerCase().split(''), | |
f = a.shift(), | |
r = '', | |
codes = { | |
a: '', e: '', i: '', o: '', u: '', | |
b: 1, f: 1, p: 1, v: 1, | |
c: 2, g: 2, j: 2, k: 2, q: 2, s: 2, x: 2, z: 2, | |
d: 3, t: 3, | |
l: 4, |
// A nano dependent type-checker featuring inductive types via self encodings. | |
// All computation rules are justified by interaction combinator semantics, | |
// resulting in major simplifications and improvements over old Kind-Core. | |
// A more complete file, including superpositions (for optimal unification) | |
// is available on the Interaction-Type-Theory repository. | |
// Credits also to Franchu and T6 for insights. | |
// This is a new development, may have bugs (: | |
// Lists | |
type List<A> = |
function Vertex(name) { | |
this.name = name; | |
this.index = null; | |
this.lowlink = null; | |
this.onStack = false; | |
this.children = []; | |
} | |
function TarjanRunner() { |
def deBruijn(n, k): | |
''' | |
An implementation of the FKM algorithm for generating the de Bruijn | |
sequence containing all k-ary strings of length n, as described in | |
"Combinatorial Generation" by Frank Ruskey. | |
''' | |
a = [ 0 ] * (n + 1) | |
def gen(t, p): |
/** By_Sean_Eron_Anderson seander@cs.stanford.edu */ | |
#include <stdbool.h> | |
#include <stdint.h> | |
#include <endian.h> | |
#define CHAR_BIT 8 | |
void Compute_the_sign_of_an_integer() { | |
/*Compute the sign of an integer*/ |
const logicGates = { | |
nand (a, b) { return !(a && b); }, | |
not (a) { return this.nand (a, a); }, | |
and (a, b) { return this.not (this.nand (a, b)); }, | |
or (a, b) { return this.nand (this.not (a), this.not(b)); }, | |
nor (a, b) { return this.not (this.or (a, b)); }, | |
xor (a, b) { return this.and (this.nand (a, b), this.or(a, b)); }, | |
xnor (a, b) { return this.not (this.xor (a, b)); } | |
}; |