junke

60 ms·

631.
by junke 10y ago
Consider this snippet of C code: struct foo { int x; } Do you care how the structure definition is represented in your compiler? is it a list, a vector or a custom data-structure? You don't know, and it doens not m
632.
by junke 10y ago
Don't put parenthesis around "a", this is a function call. (when (and a (not b)) expr ... expr)
633.
by junke 10y ago
Ada (Ravenscar profile) allows exceptions: http://www.sigada.org/ada_letters/jun2004/ravenscar_article....
634.
by junke 10y ago
I am fine with statically checking types, or any kind of proof. Are your floating points calculations always precise enough? Can you detect if no user inputs ever reaches critically secure code without being sanitized? Does this multi-threa
635.
by junke 10y ago
Ok for parametric polymorphism: the identity function in OCaml has type 'a -> 'a, whereas in SBCL it is "(function (T) T)". On the other hand, "(lambda (x) (if x 0 1))" is a function from T (anything) to the
636.
by junke 10y ago
Concise notations are great, and this is why regexp are so much used IMO. I am by the way a fan of sed, which is clever enough to give you the choice over the delimiter you use (s+/+_+g). On the other hand, there are so many additions
637.
by junke 10y ago
You're doing some major revisionism with this post and claiming a lot of completely unsubstantiated (and in my opinion, completely made up) facts. ( https://news.ycombinator.com/item?id=11699585 )
638.
by junke 10y ago
Synchronous programming is mostly a French thing but as far as I know there is also Quartz in Germany ( https://es.cs.uni-kl.de/publications/datarsg/Schn09.pdf ), Ptolemy in Berkeley ( http://ptolemy.eecs.
639.
by junke 10y ago
> Do you have a link to your thesis? There is only a French version: https://tel.archives-ouvertes.fr/tel-00680308/ The context is about using a constraint programming approach (in Prolog) to model Lustre/Scade
640.
by junke 10y ago
Synchronous Programming of Reactive Systems, Halbwachs Synchronous Languages for Hardware and Software Reactive Systems, Berry Designing Embedded Systems with the SIGNAL Programming Language, Gamatié The Synchronous Languages 12 Years Later
641.
by junke 10y ago
I am happy to see Elm evolving and it looks like a good framework, but there is a tendency in FRP articles to ignore prior work, as acknowledged at the end of the article: > Note: Interested readers may find Lucid Synchrone interesting.
642.
by junke 10y ago
For details, see http://pastebin.com/raw/1W88ywuu The actual test: (defparameter *model* (make-model (cl-json:decode-json-from-source #P"/tmp/json.test"))) (with-table (farmers :tit
643.
by junke 10y ago
pgloader: load from CSV (and others) to postgreSQL. See http://pgloader.io/howto/quickstart.html
644.
by junke 10y ago
Thanks for your comment, this is very instructive.
645.
by junke 10y ago
Who doesn't like having to escape double-quotes and newlines or the simple yet powerful aesthetics of programs entirely styled in font-lock-string-face?
646.
by junke 10y ago
CEPL does not try to fix the underlying problem, but provide a decent way of working with it. The Varjo compiler seems already quite evolved and sure, it could be better. On the other hand, this seems to be a single-person project ( http:&#
647.
by junke 10y ago
Young fool, only now, at the end, do you understand... code is data. CEPL demos: https://www.youtube.com/watch?v=2Z4GfOUWEuA&list=PL2VAYZE_4w... I get it, there are many good reasons to stick to C++ if you want to ship
648.
by junke 10y ago
Or maybe they speak spanish: https://usercontent1.hubstatic.com/209666_f520.jpg
649.
by junke 10y ago
Lisp has a rich type system and there is no conceptual problem in having both static analysis and dynamic checks. What happens, especially with classes, is that you cannot guarantee that your type hierarchy will not be altered at the time y
650.
by junke 10y ago
Okay, but the article has almost nothing to do with that, which is a subset of what macros are used for. It is about CL lexical binding, Rebol's definitional scoping and evaluation of data as code at runtime.
651.
by junke 10y ago
Which problem?
652.
by junke 10y ago
I have tried to use SBCL's code walker on a pet project and so far I have no problem with it; in fact it is surprisingly easy to use. By the way, the following post is a good introduction to it: http://christophe.rhodes.io&#
653.
by junke 10y ago
I am not fanatic and I liked this article because I don't know Rebol very much. Rebols quoted code and "use" remind me a little of "uplevel" in Tcl. I don't see a use case where I would like eval to capture th
654.
by junke 10y ago
Don't forget Wiio's laws ("Communication usually fails, except by accident"). See https://www.cs.tut.fi/~jkorpela/wiio.html
655.
by junke 10y ago
> Something MOP related Postmodern[0] defines simple wrapper objects so that you can access databases rows as objects. The same goes for the Elephant persistent database[1]. Cells[2] define metaobjects for classes with dataflow dependenc
656.
by junke 10y ago
Sure, this is a valid concern, but in the context of a learning experiment like the one discussed here, this is not really important. "Hey kid, nice treehouse, but what about burglars?"
657.
by junke 11y ago
Because it uses static analysis techniques, that's all. You type variables and consider all execution paths at once, instead of executing code and checking the types of values. In particular, the code that was generated won't get
658.
by junke 11y ago
The type analysis happens only after I enter "(foo 0)" in the REPL, which is execution time.
659.
by junke 11y ago
Yes, during compilation. (defun foo (x) (compile () `(lambda (u) (print "Executed") (aref ,x u)))) (foo 0) ... reports a comp
660.
by junke 11y ago
Fine, but there is surprisingly no mention of Lisp in the related work, which defines a COMPILE function in its specification. In a language where the compiler is part in your runtime, type checking is equally available at different executi

More ›