malisper

47 ms·

481.
by malisper 12y ago
Your example assumes that you can inline the calls to a and b. If you can't (for example if one of them calls themselves) then your optimization won't work.
482.
by malisper 12y ago
> Tail-recursions are the exact equivalent of loops. Not necessarily. In the common case of a procedure calling itself a loop does wind up being equivalent. OTOH with mutually recursive procedures (two or more procedures which call each
483.
by malisper 12y ago
> There are theoretical limits to the upper bound of problem size. Big O is defined as what happens as the size of the input approaches infinity. You cannot take a O(log n) algorithm and say it is effectively O(1), that is not what big O
484.
The Common Lisp Condition System(en.wikibooks.org)
28 points by malisper 12y ago|3 comments
485.
by malisper 12y ago
Slime is really amazing. It provides tons of features of which here are a few (these work with Common Lisp, I have no clue if they work with Clojure). Inspector[0]: You can click on objects to "inspect" their values. This includes
486.
by malisper 12y ago
The big question is whether or not this is faster than the implementation of Arc on top of racket. Arcueid, which is an Arc interpreter written in C actually wound up to be "about an order of magnitude slower" than the racket vers
487.
by malisper 12y ago
Except YC also funds nonprofits[0]. [0] https://www.ycombinator.com/nonprofits/
488.
by malisper 12y ago
My bad. What I wanted to say was that Hacker News was not meant to be used at the scale it is used today.
489.
by malisper 12y ago
Hacker News was not meant to be something actually used, it was originally designed to be a way to test Arc[0]. Additionally, the code was meant to be a short as possible[1]. [0] http://paulgraham.com/hackernews.html [1] h
490.
by malisper 12y ago
It shouldn't be very hard to create a basic ownership system. Here is a version I just wrote, which works by defining a new version of "defun" that uses dynamic variables to keep track of ownership: (defvar *transferring*
491.
by malisper 12y ago
Location: Chicago. Remote: Yes. Willing to Relocate: To California. Technologies: Common Lisp, Emacs, Scheme, willing to learn Clojure. Resume: My resume is available in PDF and in Org Mode. PDF: https://drive.google.com/fil
492.
by malisper 12y ago
Lisp provides a couple really powerful DSLs. Some of more easily understandable ones I can think of: Loop: http://www.gigamonkeys.com/book/loop-for-black-belts.html Symbolic Manipulation: http://norvig.com&#
493.
by malisper 12y ago
It's probably more idiomatic to implement something similar to the with-slots macro by using symbol-macrolet: (defmacro with-keys (keys table &body body) (let ((gtable (gensym))) `(let ((,gtable ,table)) (sym
494.
by malisper 12y ago
It looks like there is an extension to Parenscript called PSOS[0], which provides conditions/restarts and something similar to CLOS. [0] https://github.com/gonzojive/paren-psos
495.
Python for Lisp Programmers(norvig.com)
4 points by malisper 12y ago|0 comments
496.
by malisper 12y ago
There is a problem with comparing programming languages using something similar to Rosetta Code. All of the examples tend to be short and somewhat trivial, while in the real world, programs are magnitudes larger. Some of the differences in
497.
The Roots of Lisp (2002) [pdf](slackwise.net)
57 points by malisper 12y ago|11 comments
498.
The Roots of Lisp(lib.store.yahoo.net)
2 points by malisper 12y ago|0 comments
499.
by malisper 12y ago
A simple example of homoiconicity: (+ 1 2) is a list containing the 'plus' symbol the number 1 and the number 2. (+ 1 2) is a program which when ran gives the number 3 as the result. They are the exact same thing.
500.
Trevor Re: Java's Cover(paulgraham.com)
1 points by malisper 12y ago|0 comments
501.
by malisper 12y ago
For anyone with an interest in implementing a basic garbage collector, I recommend SICP[0], specifically section 5.3[1] and the lecture that goes along with it[2]. [0] http://mitpress.mit.edu/sicp/full-text/book&#x
502.
by malisper 12y ago
It's just the way you phrased it, core.logic for Clojure, various Kanrens for Scheme , as opposed to, implementations for Kanren in Clojure and Scheme such as core.logic.
503.
by malisper 12y ago
Just a nitpick, but core.logic is a version of Kanren[0]. [0] https://github.com/clojure/core.logic
504.
by malisper 12y ago
I recognized the talking over the phone thing from SICP. http://youtu.be/X21cKVtGvYk?t=22m40s
505.
Show HN: Clamp – Common Lisp with Arc Macros and Procedures(github.com)
41 points by malisper 12y ago|0 comments
506.
by malisper 12y ago
Not the parent, but I recently wanted ssyntax[0] in Common Lisp, so I decided to write an implementation for it[1]. In doing so, I created a DSL for defining ssyntax (made up of defssyntax-test, defssyntax-macro, and defssyntax-sym-mac). Ju
507.
by malisper 12y ago
At the bottom it says that SBCL 1.0.18 was used. That version came out in mid 2008[0]. Therefore the article is at most six years old. As for concerns about the ecosystem, you are going to have to elaborate. [0] http://t20846.lis
508.
by malisper 12y ago
I couldn't resist. http://common-lisp.net/language.html
509.
by malisper 12y ago
Don't forget paredit, ac-slime, and redshank.
510.
by malisper 12y ago
There's nothing complicated about using it. I'm not talking about using the pipe operator, I'm talking about implementing it. The C++ version is ridiculously complicated. Let's compare your code with an analogous imple

More ›