how can i know if a function name provided as string is callable or not in the current context? something like:
I\'m baffled by trying to create the equivalent of this trivial (in Common Lisp) macro in MIT Scheme:
开发者_JS百科I am wrote the code with bugs. Example: (print (/ 1 0)) I am trying compile with C-c C-c.
I am trying to modify an existing Hill-climb function, which takes two node names (such as A and E), and has an optional parameter which is used recursively (a queue). I\'m trying to define a function
How can I represent a char (character) in clojure? Also I would like an example to test it using the char? function
I am trying to inspect the value of a variable 开发者_如何学运维at a determined breakpoint. Here is my simplified code:
I\'ve noticed quite a few examples in various Lisps (at least Common Lisp and Emacs Lisp) where two or more functions had identical names except for a trailing number. For example, Emacs Lisp has eval
I am a beginner in lisp and have a question. When I writing some code directly in REPL (without any .lisp file!), how can I save my work/state of the interpreter to restore it 开发者_如何学编程next ti
cons currently behaves like so: (cons \'(1 2) \'(3)) ;=> ((1 2) 3) I would like to achieve: (magic-cons \'(1 2) \'(3))
I\'m trying to write a function that works like remove-duplicates, but it instead takes two lists as input, the first specifying characters for which duplication is not allowed, and the second being a