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?

## Recent comments

8 hours 17 min ago

8 hours 17 min ago

18 hours 49 min ago

23 hours 9 min ago

1 day 57 min ago

1 day 2 hours ago

1 day 5 hours ago

1 day 6 hours ago

1 day 7 hours ago

1 day 7 hours ago