pflanze

25 ms·

1. 211.▲
   by pflanze 7y ago

   To make my own statement more complete/correct: > The clean solution for this is functional programming or another model that guarantees that modifications are never seen by code that isn't explicitly meant to receive them--the
2. 212.▲
   by pflanze 7y ago

   Correct. You can use libraries in Perl (autobox and a class offering "join") so you can write it in Perl as: $foo->{bar}->join(',') I've done that in FunctionalPerl[1]: use FunctionalPerl ":au
3. 213.▲
   by pflanze 7y ago

   I think OP's point was that even in Python you have to be conscious where your "storage" is--that you're sharing it. Yes, the "Python" model (or Java, JavaScript) of referring to everything by reference is unif
4. 214.▲
   by pflanze 7y ago

   Location: London/UK Remote: is fine Willing to relocate: around London, Berlin, Zurich Technologies: Scheme, Rust, Haskell, Clojure; backend, systems, (frontend) Résumé/CV: https://github.com/pflanze?tab=repositori
5. 215.▲
   by pflanze 7y ago

   Are you talking about Kullback-Leibler divergence? Will have to read up on that. Or can you clarify what you mean?
6. 216.▲
   by pflanze 7y ago

   I'll be making an attempt here to compare that number to the complexity of programs in software. It's the first time I try to do this and I'm sure I don't know enough to make a good comparison, anybody please correct me.
7. 217.▲
   by pflanze 7y ago

   > and it terrifies me You can get natural gas alarms cheaply e.g. on Amazon. Since natural gas is lighter than air, they should be mounted above the hob area.
8. 218.▲
   by pflanze 7y ago

   I'm working my way towards doing that. I've got more than a decade of experience with Scheme and would like to be able to code Scheme in the Julia environment. I also recently started learning Clojure (and implementing Clojure in
9. 219.▲
   by pflanze 7y ago

   You need to check very carefully before you can conclude they were bio-degradable. I have only seen degradable plastic carry bags in the UK which were not in fact bio-degradable. Traditional plastic bags manufactured to be falling into piec
10. 220.▲
    by pflanze 7y ago

    What are the best strategies to cope with the undefined areas in C?
11. 221.▲
    by pflanze 8y ago

    I had the same experience with a T61 I owned, and used to just tape a bit of plastic foil over the reader (I wasn't using it).
12. 222.▲
    by pflanze 8y ago

    Thanks for your reply. I fully agree.
13. 223.▲
    by pflanze 8y ago

    I'll mention an earlier comment of mine: https://news.ycombinator.com/item?id=18045890 (a Scheme interpreter running in C++ land, to communicate with via s-expressions (really Scheme code) from 'real' Scheme
14. 224.▲
    by pflanze 8y ago

    > The distinction in the vernacular between statically typed and strongly typed languages is so narrow at this point that pointing it out is a bit pedantic. I'm not sure why you think this has changed today, or what you mean. It app
15. 225.▲
    by pflanze 8y ago

    I've written a script to allow me to filter the list, using the Functional Perl libraries. Maybe someone will translate it to JS? https://github.com/pflanze/functional-perl/blob/master/examp... If y
16. 226.▲
    by pflanze 8y ago

    I should probably try this. I wonder how it will compare with what I'm doing: I simply use the browser's (Firefox) save page feature (ctl-s). Then every now and then, I convert the folder with these pages to a squashfs image (whic
17. 227.▲
    by pflanze 8y ago

    I have removed the file again.
18. 228.▲
    by pflanze 8y ago

    If you prefer the HTML pages for offline reading like I do, you can save yourself the work of selectively downloading them and get the whole bunch from: http://christianjaeger.ch/scratch/www.iecc.com-linker-only_h... T
19. 229.▲
    by pflanze 8y ago

    > protoAST lacks the knowledge the specific code walker adds Yes, that's why I actually had said "by grouping the resulting s-expr with a context and a correct tree-walker ". True, you could make that (let* ((protoAS
20. 230.▲
    by pflanze 8y ago

    I know. Sorry for my messy terminology. (Not sure whether the points I'm making here are useful or just wasting your time, I'll try to explain just to clarify what I meant.) I didn't mean calling the individual functions impl
21. 231.▲
    by pflanze 8y ago

    > But it shouldn't be surprising that some languages are less efficient than others, right? A long time ago I read a comment somewhere saying that Arc is interpreted (as in by a program itself written in MzScheme, instead of transla
22. 232.▲
    by pflanze 8y ago

    I don't really have a use for this. Gambit-C allows to include C files or also strings of C code from a Scheme module and builds it as one. I haven't used Racket's FFI though, perhaps the real benefit is from parsing the C co
23. 233.▲
    by pflanze 8y ago

    We are working on a product written in Scheme. It's mostly just me currently. Not (currently) using Racket, but a set of libraries[1] on Gambit-C, as well as an interpreter written in C++[2]. We might take someone on board a few months
24. 234.▲
    by pflanze 8y ago

    I was talking about macro-expanding the form first so that the result to be walked consists of only "core" lisp forms. Do you mean that there are macro-expander APIs in CL that offer all ingredients to do the derivation as part of
25. 235.▲
    by pflanze 8y ago

    This, together with taeric's question about tokenization made me realize that we can think of it this way: Macros are not receiving AST nodes [1]. They are not receiving tokens either, though. But something in-between: how many tokens
26. 236.▲
    by pflanze 8y ago

    Here's a perhaps better CL example as it side-steps the non-shadowability of the common-lisp math operators: (+ (flet ((f (a) (* a a))) (f 10)) 2) This would, as I already mentioned, require the code walker to support flet, and
27. 237.▲
    by pflanze 8y ago

    Hmm, true you're walking the code already. What you don't do is look at the lexical context or maintain it while walking. S-expressions in full Lisp don't specify lexical constructs, it is only the pre-cursor of such (people
28. 238.▲
    by pflanze 8y ago

    Note that 'not requiring a parser' is only true iff you limit the expression language you transform to one that has no syntactical constructs (i.e. can't introduce new bindings). If you want to allow those then you need a &qu
29. 239.▲
    by pflanze 8y ago

    > One could write the same code in python/javascript with using lists and strings and recursion in a similar way, no? Then you're implementing a Lisp (just one with square instead of round brackets, and commas between list elem
30. 240.▲
    by pflanze 8y ago

    But the optimization there is rewriting the algorithm (which is 'brittle' because it depends on the operation used being commutative in that example). Just optimizing tail calls as written in the programmer's code (which is w