Based on Huet 1976, §5.7.2
From earlier sections
V
is a countably infinite set of variables.C
a finite set of constructors.a : C -> Nat
an arity function.R : V -/-> Typ
a partial environment function.
// | |
// mapEngine.m | |
// TestRun | |
// | |
// Created by Ashok Menon on 20/08/2010. | |
// Copyright 2010 __MyCompanyName__. All rights reserved. | |
// | |
#import "mapEngine.h" | |
#import "ImageCache.h" |
(defvar *prime* (list 2)) | |
(setf count 3) | |
(defun is-prime (n) | |
(dolist (prime-number *prime*) | |
(if (= n 1) (return-from is-prime nil)) | |
(if (= (mod n prime-number) 0) | |
(return-from is-prime nil))) | |
(return-from is-prime t)) |
class Matrix | |
end |
#include <iostream> | |
#include <set> | |
using namespace std; | |
typedef pair<int,int> pii; | |
void game(); | |
int main( int , char ** ) | |
{ |
module Undo where | |
data Op = Edit | Undo | Redo | Load | Save deriving (Eq, Show) | |
type Str = [Op] | |
type State = (Int, Int, Int) -- ( Save point, Edit distance, Undo displacement ) | |
valid :: State -> Bool | |
valid (s,e,u) = s >= 0 && e >= 0 && u <= 0 && s <= e && e+u >= 0 |
require 'set' | |
class AnagramDict | |
include Enumerable | |
def initialize | |
@dict = {} | |
end | |
def put(word) |
(defn recogniser | |
"Returns the recogniser function for the grammar `g`." | |
[g] | |
(let [nullable? (nullable g) | |
g (null-free g) | |
init (initial-state (nullable? :S))] | |
(letfn [(consume-token [{:keys [index items] :as state} tok] | |
(loop [processed? #{} | |
items items | |
state (reset-state state)] |
(ns brainfuck | |
(:refer-clojure :exclude [replace]) | |
(:require [clojure.string :refer [join replace]])) | |
;;;;;; Parser ;;;;;; | |
(defn- wrap-outer-brackets | |
"Wrap string in square brackets so that its contents are read into a vector | |
by `read-string`." | |
[s] (str \[ s \])) |
# A class to print arbitrary Sudoku-style grids, given a list of numbers | |
# Author: Ashok Menon, 01/09/2015 | |
class Array | |
def surround(delim) | |
"#{delim}#{join delim}#{delim}" | |
end | |
end | |
class Grid |
Based on Huet 1976, §5.7.2
From earlier sections
V
is a countably infinite set of variables.C
a finite set of constructors.a : C -> Nat
an arity function.R : V -/-> Typ
a partial environment function.