archives

LISP basis for computable functions on S-Expressions.

Hi all,

I want to make a minimal set of LISP functions, by which all computable functions on S-Expressions
can be computed. {car, cons, cdr, atom, equal, if} is a basis. I don't know how to prove that this is the minimal. Can you help me?

By Dr.GEorGE at 2010-03-05 13:08 | LtU Forum | 15 comments | other blogs | 9735 reads