malisper

71 ms·

451.
by malisper 12y ago
> being a winner at programming contests was a negative factor for performing well on the job The title is misleading. Being a winner of a programming competition is very different from being good at programming competitions.
452.
by malisper 12y ago
> Richard P. Gabriel critiqued this notion of "patterns should be abstracted and instantiated" I think patterns should always be "abstracted and instantiated". I always found his example of actual code in support of h
453.
by malisper 12y ago
I managed to get the code from the post you mentioned to work[0] by using macroexpand-dammit[1]. Coincidentally, you have contributed to that, so I thought I would ask you what is the problem with using macroexpand-dammit? [0] https:/
454.
by malisper 12y ago
> you can't have a macro that expands differently in different contexts This[0] may be of some help. You could set it to expand macros differently according to the current context (some global variable). You could also write your ow
455.
by malisper 12y ago
Well iterate[0], which is a lispy version of loop, is actually extendable through macros[1]. So what you are looking for is just a generic way to enable that for all macros? Iterate does it by having a code walker go over the code and macro
456.
by malisper 12y ago
Lisp doesn't have pattern matching. With optima[0] it does. Lisp uses prefix notation. With mexpr[1] it uses infix notation. And so on. [0] https://github.com/m2ym/optima [1] https://github.com/tmc
457.
by malisper 12y ago
Hacker News is actually written in a similar way[0]. Here is the code to generate the lists page[1] (the code is a bit outdated): (newsop lists () (longpage user (msec) nil "lists" "Lists" "lists"
458.
by malisper 12y ago
I guess a good place to start looking for a definition of readable would be Peter Norvig's Rule of English Translation [0]. 1. Start with an English description of algorithm 2. Write the code from the description 3. Translate
459.
by malisper 12y ago
> I wonder how the lazy sequence support stacks up to Clojure, Haskell, etc. support. A bit of a tangent, but I've been looking at the series library[0] recently. It makes it possible to write functional style code which is compiled
460.
by malisper 12y ago
It looks like they are using the issues to keep track of feature requests.
461.
by malisper 12y ago
They have multiple versions of Eliza. James Markevitch wrote the interpreter for the 1966 version[0], but they ported 1969 and 1972 versions of Eliza to CL[1]. [0] https://github.com/jeffshrager/elizagen/blob/
462.
Strong Typing vs. Strong Testing (2003)(docs.google.com)
1 points by malisper 12y ago|1 comments
463.
The Open Source Definition(opensource.org)
1 points by malisper 12y ago|0 comments
464.
by malisper 12y ago
> "open source" is mostly a common language phrase not a term of legal art The term "open source" does have an official definition[0]. It doesn't mean what most people think it does and that is one of the reasons
465.
by malisper 12y ago
> That's a pretty ridiculous use case. It was just an example. I never said you would actually want to do it. > maybe you can get this in lisp without any limitations See my response to orbifold: https://news.ycombinat
466.
by malisper 12y ago
> I guess in lisp you could more easily write a function that maps the previous representation into the new one. Lisp provides a simple way redefine classes. There is a generic function (basically a function that is extensible), update-i
467.
by malisper 12y ago
Could you redefine a class/structure and update every instance of it at runtime? For example, let's say you are currently representing complex numbers in rectangular form. Is it possible to convert every existing instance to polar
468.
by malisper 12y ago
Makes sense. It's just to me, as someone who knows LOOP that (loop repeat n thereis (valid (read-password)) finally (lock-account)) seems simpler than (do ((i 0 (+ i 1))) ((>= i n) (lock-account))
469.
by malisper 12y ago
I agree with you to some degree. Higher order functions should be used wherever possible and there should be some alternatives to LOOP for the common cases such as iterating over a range of numbers. It is much easier to understand patterns
470.
by malisper 12y ago
You misspelled 'disappoint' in the first sentence.
471.
by malisper 12y ago
Could you give an example of the Arc Challenge[0] with it? I would like to see something we could use as a comparison to those other langauges. [0] http://arclanguage.org/item?id=722
472.
The Rise of Worse Is Better(dreamsongs.com)
1 points by malisper 12y ago|0 comments
473.
by malisper 12y ago
He linked to another essay of his: http://blog.samaltman.com/growth-and-government
474.
by malisper 12y ago
Can someone explain what exactly the library does? All I got from the description is something about a way of building an argument list, and then how it is possible to fulfill some dependencies with factories or make methods or something.
475.
by malisper 12y ago
The next question is what happens to people who want to work in the US?
476.
by malisper 12y ago
> If tech wants the best workers, there are plenty of willing and capable Americans ready to pick up the work. Are the people currently available really the best?
477.
Trolls (2008)(paulgraham.com)
3 points by malisper 12y ago|3 comments
478.
Labels(paulgraham.com)
13 points by malisper 12y ago|2 comments
479.
by malisper 12y ago
The one feature that really differentiates Lisp from other languages is its macro system. Macros allow you to give arbitrary semantic meaning to an expression. The expression (a b c) could quite literally do anything. It could set the value
480.
by malisper 12y ago
Seems possible. You would need to write a j->cl compiler, but once you have that, the rest is trivial.

More ›