cons car and cdr implemented as javascript functions. cribbed from SICP http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-14.html#%_thm_2.4then implemented a bunch of functions just for fun.

cons, car, cdr

// clean and pure:
function cons(x, y) {
    return function(pick) {
        return pick(x, y);
    }
}

// does more stuff:
function cons(x, y) {
    var fn = function(pick) {
        return pick(x, y);
    };
    fn.toString = function() {
        return "(" + asArray(this).join(" ") + ")";
    };
    fn.pair = true; // to support atom? function
    return fn;
}

function car(f) {
    return f(function(x, y) { return x; });
}

function cdr(f) {
    return f(function(x, y) { return y; });
}

function atom(x) {
    return !x.pair;
}

function pair(x) {
    return x.pair;
}

function list() {    
    var args = Array.prototype.slice.call(arguments);
    return (args.length === 0) ? null : cons(args.shift(), list.apply(null, args));
}

function map(fn, lat) { 
    return (lat === null) ? null : cons(fn(car(lat)), map(cdr(lat), fn)); 
}

function flip(fn) {
    return function(a, b) { return fn(b, a); };
}

function foldl(fn, acc, lat) { 
    return (lat === null) ? acc : foldl(cdr(lat), fn(acc, car(lat)), fn);
}

function append(l, m) {
    return (l === null) ? m : cons(car(l), append(cdr(l), m));
}

function reverse(l) {
    return (l === null) ? null : append(reverse(cdr(l)), cons(car(l), null));
}

function foldr(fn, acc, lat) {
    return (lat === null) ? acc : fn(car(lat), foldr(fn, acc, cdr(lat)));
}

function filter(fn, lat) {
    if (lat === null) return null;
    if (pred(car(lat))) return cons(car(lat), filter(cdr(lat), fn));
    return filter(cdr(lat), fn);
}

function some(pred, lat) {
    return (lat === null) ? false : pred(car(lat)) || some(cdr(lat), pred);
}

function every(pred, lat) {
    function everyAcc(lat, acc) {
        if (lat === null) return acc;
        return everyAcc(cdr(lat), pred(car(lat)) && acc);
    }
    return (lat === null) ? false : everyAcc(lat, true);
}

function leftmost(tree) {
    // get the leftmost leaf node
    if (tree === null) return null;
    if (atom(car(tree))) return car(tree);
    return leftmost(car(tree));
}

function contains(tree, a) {
    if (tree === null) return false;
    if (atom(car(tree)))
        return car(tree) === a || contains(cdr(tree), a); 
    else 
        return contains(car(tree), a) || contains(cdr(tree), a);
}

function asArray(list) {
    var arr = arguments[1] || [];
    return (list && car(list)) ? (arr.push(car(list)), asArray(cdr(list), arr)) : arr;
}

function asList(arr) {return list.apply(null, arr);}

yes, fun stuff, i think i dreamed about how this works last night ....

function toList(arr, list){
    return arr.length ? toList(arr, cons(arr.shift(), list)) : list;
}

car(toList([1,2,3]));            //3
car(cdr(toList([1,2,3])));       //2
car(cdr(cdr(toList([1,2,3]))));  //1

Forked and made some changes: https://gist.github.com/CrossEye/5307355

cool, have you seen this implementation? https://gist.github.com/bishboria/1170180