junke

16 ms·

91.
by junke 6y ago
For your particular example, it seems you could use a dataflow approach, like the one in Cells (K. Tilton) (see tutorial: http://stefano.dissegna.me/cells-tutorial.html , and documentation: https://gitlab.common-l
92.
by junke 6y ago
Julia too
93.
by junke 6y ago
Just to clarify, CLOS is very a-la-carte too.
94.
by junke 6y ago
This could be a game where you have to fly a plane, looking only at the instruments (this kind of training exists for real pilots).
95.
by junke 6y ago
I agree that it's probably what they think. My opinion is that flagging is unecessary in that case since people can already downvote and hide distracting comments. Thanks for your answers.
96.
by junke 6y ago
Thanks for replying. I was thinking about the "Make X Y Again" types of article that, intentionally or not, invites offtopic discussion. The original comment from simonw ( https://news.ycombinator.com/item?id=231375
97.
by junke 6y ago
"Back to fast compilation." If you want a meme: "Faster than before" Or maybe "Getting LLVM to compile as fast as it used to." And 10 years ago I would have maybe suggested "Make LLVM fast again" but
98.
by junke 6y ago
By using this title, it is the author, not readers, that brings politics into the discussion. It has a connection, right there in the title. Maybe it is just a joke, a way to boost clicks, or some kind of myopic view that says technical peo
99.
by junke 6y ago
Are comments about the title of articles offtopic? Because sometimes comments that discuss titles, without being inflammatory, are flagged, and sometimes they aren't.
100.
by junke 6y ago
What is magical apart from pattern matching is how you can invocate it with mixed ground terms and variables, and it computes values that makes the relationship holds. For example: [eclipse 2]: concat(A,[_,_],[0,1,2,3,4]). A = [0
101.
by junke 6y ago
https://www.google.com/amp/s/www.wired.com/story/the-pernici...
102.
by junke 6y ago
> Lisp macros operate on a representation of the AST. The representation of the AST is the AST in Lisp (Scheme has syntax objects). > By overhead I mean the nim compiler can generate direct specific instatiations at compile time ins
103.
by junke 6y ago
Ok this is nice but you this would be rougly the same in Lisp, apart from AST constructors ("newIdentNode()",...), which would simply be backquote/unquote. Plus you have to write enumInfo[0], enumInfo[1] instead of pattern ma
104.
by junke 6y ago
Primitive Emacs Lisp functions are defined in C, yes, using helper C macros. There might be a way to extract the symbol names from those macros, and maybe enough information to generate the FFI bindings. Any kind of rewrite of Emacs is goin
105.
by junke 6y ago
You don't need to rewrite packages if you have a layer where Emacs Lisp is compiled/interpreted as Common Lisp. You can easily hack the readtable in Lisp, and rewrite Emacs Lisp sexps as Common Lisp sexps. Some interesting things
106.
by junke 6y ago
soft real-time https://en.wikipedia.org/wiki/Real-time_computing#Criteria_f...
107.
by junke 6y ago
Additionally, "to cons" more broadly means "to allocate memory".
108.
by junke 6y ago
Thanks, I might write some idioms in it.
109.
by junke 6y ago
Sorry, [Common Lisp] is currently not a supported language. New time sink avoided.
110.
by junke 6y ago
Andy Gavin (in the video) was also responsible for the development of GOAL, Game Oriented Assembly Lisp ( https://en.wikipedia.org/wiki/Game_Oriented_Assembly_Lisp )
111.
by junke 6y ago
Declaring and checking the type of values is still dynamic typing, I see no static types here.
112.
by junke 8y ago
Practical Common Lisp, Common Lisp Recipes
113.
by junke 8y ago
I do not use cl-launch, but for some tasks at job I wanted to pipe programs, and just wanted to try implementing something myself. The with-pipeline macro creates temporary fifos to connect programs and threads (random example): (let
114.
by junke 8y ago
What do you mean?
115.
by junke 8y ago
Integer overflow.
116.
by junke 8y ago
https://en.wikipedia.org/wiki/List_of_computer_algebra_syste...
117.
by junke 8y ago
Note: at the beginning, you speak about learning a function "g" that approximates a function "f", then later, you swap them and learn a function "f" that approximates "g". That could be confusing;
118.
by junke 8y ago
No need to install anything with "Tramp" mode ( https://www.emacswiki.org/emacs/TrampMode )
119.
by junke 8y ago
"+" is a function, what makes it "right" to be a method?
120.
by junke 8y ago
In Go, in Javascript, in Python, in C++, you have the luxury of having thousands of people who just implement things for you while you sleep. See the list of "gold members" for the Standard C++ Foundation: https://isocp

More ›