Return the id of the given object.

Return t if x and y are equal when matched in unification.

Returns the class-name of the object as a string in lower case

Recursively check whether an element can be found in a list. Returns T or NIL.

More efficient function than comparing lengths of lists, capable of handling cons-lists.

Recursively fetch the first atom of a list.

recursively fetch the last atom in a list.

If x, then cons x in lst.

Returns the second element of an alist if found.

Fetch the last element of a list.

Checks whether a list is bigger than 1.

Substitute an alist-element if one already exists, cons it if it does not.

Remove all elements that are member of the items.

Like eval, but ensures that the expression is compiled before evaluation.

Can be used in systems where eval performs interpretation instead of compilation. Warning: Compilation is not always better, especially not for one-shot evaluations. The reason is that execution speed is compilation + execution, not just execution. Only if compilation + execution < interpretation, it is a good idea to use compiled-eval.

Easier to remember/write replacement for multiple-value-bind.

Only setfs the variable when it was nil.

Name-value pretty-printer shorthand.

Function call pretty-printer shorthand.

for each symbol passed it prints a 'name: value' line.

Pretty print the macro-expansion of a macro-call.

If a value can be found for all vars, then execute the then-clause.

If a value can be found for all vars, then execute the then-clause.

Easier to read than do macro.