Viewing profile — ericbb
ericbb
HN member- Joined
- Fri, Nov 06, 2009, 6:01 PM UTC
- HN karma
- 149
- Public activity
- 117 items
- HN profile
- View on Hacker News ↗
About ericbb
eric.bergstrome@gmail.com
Recent public activity
-
comment
Comment #19295088
I think it's "Play": https://fonts.google.com/specimen/Play
-
comment
Comment #15820389
(Replying to my own comment because I don't see a way to edit it.) Another question I have is about recursion. Browsing through the code a little bit, I see loops and comprehension…
-
comment
Comment #15816651
> Maybe I'll post more tomorrow, if anyone is still around. I can only speak for myself but I will definitely be around to read another post if you write one. The design is fascina…
-
comment
Comment #15610654
Here's one I made: http://norstrulde.org/ilge10/ The language is based on Scheme and Common Lisp. The instruction set is derived from one described in the book Paradigms of Artific…
-
comment
Comment #15524593
Thanks for the detailed response! My point was that the beginning of foo() is compiled to the following (by my compiler): push rbp mov rbp,rsp lea rax,[rbp+0x10] mov QWORD PTR [rbp…
-
comment
Comment #15522319
Haven't you misinterpreted "pass by reference" as "pass on the stack"? (In the following program, I'd say that x is passed on the stack but not passed by reference.) #include #incl…
-
comment
Comment #15258137
Related: Computation and State Machines by Leslie Lamport ( https://www.microsoft.com/en-us/research/publication/computa... ).
-
comment
Comment #13922607
For people reading this thread who want to better understand the distinctions between files, file descriptions, and file descriptors, I recommend Michael Kerrisk's book The Linux P…
-
comment
Comment #13342329
With the C-c issue specifically, I don't think that emulator throughput is the most likely culprit. It could be that the emulator is not handling inputs fairly: maybe it tries to p…
-
comment
Comment #13199775
I think that M-expressions are quite interesting but I'll just make a few concrete points here. > if we want (quote x) it looks as if we have to write: ... quote[x] I think that yo…
-
comment
Comment #13197249
When I mentioned "general recursive functions", I was thinking about systems that define functions using a system of functional equations rather than using a lambda term. Example: …
-
comment
Comment #13196639
> `lambda` and function application alone are Turing-complete, as McCarthy would have known. The credit here belongs with Turing and Church, not McCarthy. `atom`, `cons`, `car` and…
-
comment
Comment #12599608
I like this one even better: $ cat test.c void _start(void) { __asm__( "movabsq $6278066737626506568,%rax\n\t" "movq %rax,-32(%rsp)\n\t" "movl $1684828783,-24(%rsp)\n\t" "movw $10,…
-
comment
Comment #12598673
I always use dynamic linking but I thought it'd be fun to try making a small, static hello-world. The following assumes x86-64 Linux (and is a total hack that "works for me" NO WAR…
-
comment
Comment #12160894
Yes, I think I see your point. If I may put it in my own words, I think you are talking about "dynamic recursive activation" throughout this thread. I don't mean to disagree with t…
-
comment
Comment #12160179
That's an excellent question! :) In my language, there is no special global scope for variables; every program is basically one giant (extended and sugared) lambda calculus express…
-
comment
Comment #12159782
Matt Might's site has some pages on this topic: http://matt.might.net/articles/books-papers-materials-for-gr... http://matt.might.net/articles/intro-static-analysis/ http://matt.mi…
-
comment
Comment #12159588
I definitely struggled to find a satisfying approach to recursion in my own current language project. What I'm doing right now is passing the closure value of the callee as a hidde…
-
comment
Comment #11739780
I'm not sure what you are trying to achieve by using the infinite loop. There's a more direct way. void free_circularly_linked_list(struct node *head) { struct node *a = head->next…
-
comment
Comment #11701405
I was surprised to read that x64 apparently doesn't allow pushing or popping 32-bit values. I have a language that uses 32 bits as the basic unit for all values and I'm working tow…
-
comment
Comment #11701363
See the RISC-V User-Level ISA Specification v2.0 [1]. It's more detailed but still fairly easy reading. [1] http://riscv.org/specifications/
-
comment
Comment #11599989
That's funny. I was thinking isomorphism because you postulate an inverse, which homomorphisms don't always have. But the identity doesn't depend on f being invertible. You could j…
-
comment
Comment #11598962
This approach is strongly reminiscent of abstract algebra; for example, the Map-Reduce Transformation example seems to be(?) justified exactly when f is an isomorphism over r. I've…
-
comment
Comment #11167483
Here's one that might interest you. Generating Good Syntax Errors http://research.swtch.com/yyerror
-
comment
Comment #10225249
I don't immediately see why he is not just using NULL for nil but Interim is nonetheless more conventional than it may seem. It does use nil for '() (see [1]) and it evaluates (car…