justinmeiners

The axiom of choice says that for an infinite set of disjoint nonempty sets, we can find a set with one element from each. In others we can choose an element.

The axiom of choice is needed only when there is no clear way to choose. For example if the disjoint sets were integers, we could always explicitly pick the smallest, but for sets of sets, there isn't a clear way to pick.

Finite Set proof

Axiom of Choice = Cartesian Product

It postulates the existence of a set which is not uniquely determined, of which we know only some properties.

justinmeiners

// Here is btree.inl, which is the thing you would write yourself.

// Unlike C++ templates, the granularity of these lightweight templates is at the
// module level rather than the function or class level. You can think of it like
// ML functors (parameterized modules) except that there isn't any static checking
// of signatures (in that respect, it's like C++ templates). In my view, this style
// of parameterized generative modules is generally the better conceptual framework.

// This is a completely valid C file even prior to preprocessing, so during library
// development you can just include this file directly. That is a big win for testing

justinmeiners

READ HERE

justinmeiners

Common Options

-#, --progress-bar Make curl display a simple progress bar instead of the more informational standard meter.

-b, --cookie <name=data> Supply cookie with request. If no =, then specifies the cookie file to use (see -c).

-c, --cookie-jar <file name> File to save response cookies to.

justinmeiners

The page should be designed like a series of filters. Each function inputs a DOM tree, and returns a modified DOM tree. Filters can be chained together to produce the final results. Different filters can be chosen conditionally at each stage.

1. DOM stripping.

This phase is a removal of elements which are not relevant to text. Certain tags, can be completely blacklisted. These include:

• <button>
• <input>
• <script>
• <canvas>
• ``

justinmeiners

READ HERE

justinmeiners

; The Lisp defined in McCarthy's 1960 paper, translated into CL.
; Assumes only quote, atom, eq, cons, car, cdr, cond.
; Bug reports to [email protected].

(defun null. (x)
  (eq x '()))

(defun and. (x y)
  (cond (x (cond (y 't) ('t '())))
        ('t '())))

justinmeiners

Learn the Language

• A Beginner's Guide to Forth

• Easy Forth

• Forth Tutorial

justinmeiners

\ -*- text -*-
\	A sometimes minimal FORTH compiler and tutorial for Linux / i386 systems. -*- asm -*-
\	By Richard W.M. Jones <[email protected]> http://annexia.org/forth
\	This is PUBLIC DOMAIN (see public domain release statement below).
\	$Id: jonesforth.f,v 1.17 2007/10/12 20:07:44 rich Exp $
\
\	The first part of this tutorial is in jonesforth.S.  Get if from http://annexia.org/forth
\
\	PUBLIC DOMAIN ----------------------------------------------------------------------
\

justinmeiners

#include <iostream>

template<int N>
struct Factorial {
    enum {
        value = N * Factorial<N - 1>::value,
    };
};

template <>