Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
malisper
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
52 ms
·
511.
▲
by
malisper
12y ago
There are three reasons why a program would look like this: 1. It is something simple implemented in a complicated way. 2. It is something complicated implemented in a simple way. 3. It is something complicated implemented in a comp
512.
▲
by
malisper
12y ago
I would say the easiest to learn is Common Lisp because of the amazing debugger + conditions/restarts. If you make a mistake, instead of aborting the program like most programming languages would, Common Lisp will give you a list of r
513.
▲
by
malisper
12y ago
Location: Chicago Remote: Yes Willing to Relocate: No Technologies: Common Lisp, Emacs, Scheme Resume: My Resume is available in PDF and in Org Mode. PDF: https://drive.google.com/file/d/0Bw9be9U3doKBVnE5d1FxZEtQWk
514.
▲
by
malisper
12y ago
From[0], the answer appears to be yes, but it greatly depends on the host. One can write Common Lisp code by using uppercase. Using $native will execute the following code as Scheme code. For Clojure, it looks like Shen provides a FFI for b
515.
▲
by
malisper
12y ago
Elisp recently gained optional lexical scoping[0]. [0] https://www.gnu.org/software/emacs/manual/html_node/elisp/Us...
516.
▲
by
malisper
12y ago
According to Wikipedia[0], Brendan Eich was originally supposed to put Scheme in the Netscape web browser. Instead he decided to create Javascript and used that instead. [0] http://en.wikipedia.org/wiki/Brendan_Eich#Net
517.
▲
by
malisper
12y ago
Dijkstra clearly points out that it would be impossible to program in a natural language. The thing is there are constructed languages such as Lojban[0]. Lojban, while semantically ambiguous, is grammatically unambiguous. This means a c
518.
▲
by
malisper
12y ago
Is there anyway you, or some other moderator, could repost this in an environment that allows a proper discussion? Something like enabling the "pending comments" system.
519.
▲
by
malisper
12y ago
According to this blog post from 2009[0], it was slightly faster than C compiled with the GCC and almost 15x faster than Chicken Scheme. I have tried looking for more rigorous benchmarks but have been unable to find any. [0] http:/&#x
520.
▲
Stalin: a global optimizing compiler for Scheme
(github.com)
85 points
by
malisper
12y ago
|
70 comments
521.
▲
by
malisper
12y ago
The problem with getters and setters is that the code for them is nearly identical, yet they have to be written in nearly every single class: // Sorry if there are any mistakes, I have not // written any Java code
522.
▲
Highly Rated Movies on IMDB Needing More Votes for Top 250
(imdb.com)
1 points
by
malisper
12y ago
|
0 comments
523.
▲
by
malisper
12y ago
I believe you are missing the point he is trying to make. With parallel debugging a lot of the time will be spent looking through code that has already been checked (more women can't have a single baby in less than nine months). The on
524.
▲
IKEA Effect (Cognitive Bias)
(en.wikipedia.org)
2 points
by
malisper
12y ago
|
0 comments
525.
▲
by
malisper
12y ago
I don't know about Clojure, but Common Lisp provides something called Compiler Macros [0]. They basically allow the programmer to define two versions of a procedure. One that is a macro, and one that is an actual procedure. The macro
526.
▲
Not Invented Here
(en.wikipedia.org)
2 points
by
malisper
12y ago
|
0 comments
527.
▲
by
malisper
12y ago
You could just make them transducer-map, transducer-filter, etc. There is no reason the exact same name should be used for two different things. It is a lot harder to tell the difference between (map inc) and (map inc xs) then it is to tell
528.
▲
by
malisper
12y ago
From the standard[0], " In the form (rotatef place1 place2 ... placen), the values in place1 through placen are read and written. Values 2 through n and value 1 are then stored into place1 through placen. It is as if all the places for
529.
▲
by
malisper
12y ago
I'm surprised there is no mention of Lispbox[0], by far the easiest way to set up Common Lisp. [0] http://common-lisp.net/project/lispbox/
530.
▲
by
malisper
12y ago
There was a previous thread about egison[0]. Several of us were curious as to why you created an entirely new language. Can't the kind of pattern matching egision provides be implemented in some other Lisp through macros? [0] https:&#
531.
▲
by
malisper
12y ago
The closest thing I can think of would be Lisp (any dialect) because of the ability to add embedded languages/DSLs to the language. Pure Common Lisp (no macros), does not have any iteration constructs (besides goto). On top of these ba
532.
▲
Summer Games Done Quick
(gamesdonequick.com)
1 points
by
malisper
12y ago
|
0 comments
533.
▲
iStockAlerts
(istockalerts.com)
1 points
by
malisper
12y ago
|
0 comments
534.
▲
by
malisper
12y ago
I'm curious too. From the website[0] it looks like Egison was designed to do pattern matching. The whole language is built around it. This way Egison can do more complicated kinds of pattern matching such as matching patterns against g
535.
▲
by
malisper
12y ago
Reminds me of the pattern matcher pg wrote in 18.4 of On Lisp [0]. [0] http://ep.yimg.com/ty/cdn/paulgraham/onlisp.pdf
536.
▲
by
malisper
12y ago
Clojure[0] and Anarki[1] (public fork of Arc) both provide a way to do this (with more than one argument as well). They both have syntax for a "literal function". Your second example would become: Arc/Anarki: [format-names2
537.
▲
by
malisper
12y ago
Does anyone know if it would be possible to design something like this today? One that would be quick and easy to use so a programmer does not have to waste time moving their hand between the keyboard and the mouse.
538.
▲
J-Mouse
(computerhope.com)
4 points
by
malisper
12y ago
|
1 comments
539.
▲
by
malisper
12y ago
A lot of teachers give an effort grade as well as an achievement grade. One of my high school teachers gave a whole lecture on how even though Usain Bolt is the fastest man alive, he probably isn't the one who trains the hardest. He be
540.
▲
by
malisper
12y ago
I believe it should be something along the lines of: sumacc xs = summer xs 0 where summer [] n = n summer (x:xs) n = summer xs (x+n) I'm sure there are macros in some library somewhere that implement pattern matchi
More ›