Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ret2pop
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
ret2pop
7mo ago
A sibling post: https://blog.kleisli.io/post/dependent-types-in-pure-nix
2.
▲
Trampolining Nix with GenericClosure
(blog.kleisli.io)
16 points
by
ret2pop
7mo ago
|
1 comments
3.
▲
Dependent Types in Pure Nix
(blog.kleisli.io)
1 points
by
ret2pop
7mo ago
|
0 comments
4.
▲
by
ret2pop
2y ago
oh yeah, Urbit; I'm quite aware of the project and can recognize that to some I might just be explaining it in an intentionally confusing manner, perhaps. I do think the original intent of Urbit was to naturally select nerds, basically
5.
▲
by
ret2pop
2y ago
Writer of this article here. It was never meant to be a pot-shot, and I have nothing against lisp. I can tell why it reads that way, and we added that in because we wanted to illustrate why people should care. As to your claim about us bein
6.
▲
by
ret2pop
2y ago
ding! I think the bootstrapping code might've bitten us. Of course there's no practical reason why we _needed_ to not have the delim flag flipped and a couple of delimiters defined, but there's a conceptual symmetry in it bei
7.
▲
by
ret2pop
2y ago
Self explanatory grammars: there's the stem-like syntax that I showcase and you could write a lisp like syntax in it pretty easily. I'd imagine you don't want to use this in production yet. As for self explanatory bootstrap c
8.
▲
by
ret2pop
2y ago
There's a lot to explain, and it has occurred to me that I have explained it in a suboptimal manner. Writer of this post, by the way. The problem is that there is just so much to communicate (the design for this language with Matthew t
9.
▲
by
ret2pop
2y ago
Yes, although then at that point you'd be writing your own parser and interpreter basically, which Cognition automates to some extent
10.
▲
by
ret2pop
2y ago
Oof. I'll fix that in some time.
11.
▲
by
ret2pop
2y ago
Thanks for your feedback! I'm not accusing you of not reading the full article, but you should if you haven't already. Also, we don't know the extent to which we made anything new; if you think you can do what we're doin
12.
▲
by
ret2pop
2y ago
Writer of this article: Thank you! I don't mind the snakry comments. In fact, I welcome them as I think they are pretty funny themselves. We'll most certainly be working on more dark magic in the future.
13.
▲
by
ret2pop
2y ago
Indeed. I am the writer of this blog post and Matthew and I never intended for this to be a joke. In fact, we thought we had programmed something unique that nobody had done before, and the bootstrapping code syntax is minimal by design (yo
14.
▲
by
ret2pop
2y ago
Hi, I'm the one that wrote this blog post! A lot of comments treat this project as a joke or some form of satire, but we've spent 3 months writing this after initially coming up with the idea because we thought nobody had created
15.
▲
by
ret2pop
2y ago
recursive descent parsers generally work by doing something in the future based on the current token read, whereas Cognition works by getting a single token and then evaluating it or putting it on the stack based on the crank. If you think
16.
▲
by
ret2pop
2y ago
To be more specific, it makes whatever you read ahead tokenized already. If you read the full article it becomes more clear.
17.
▲
Cognition: A Programming Language with Runtime Tokenization Programming
(ret2pop.nullring.xyz)
4 points
by
ret2pop
2y ago
|
4 comments
18.
▲
by
ret2pop
3y ago
To be fair, I am inexperienced. I haven't done much programming in stack based languages and I don't often like to pull the age card but in my defense I have not lived as long as some other people on here as I just turned 18 and h
19.
▲
by
ret2pop
3y ago
factor seems to be doing pretty well, and so is of course forth.
20.
▲
by
ret2pop
3y ago
Hey thanks! I didn't think people would actually care about this lol
21.
▲
by
ret2pop
3y ago
yes, i have actually thought about this solution independently, but i still find it a little bit ugly to have to tell the parser that everything past a certain point is runtime, if I am understanding this correctly.
22.
▲
by
ret2pop
3y ago
Intepreted... right now. There isn't a vm currently, but I'm planning to do native compilation pretty soon, as I already have an idea of how I would go about doing it.
23.
▲
by
ret2pop
3y ago
I was not aware of this, thanks for giving me an explanation. I don't have any experience writing in forth, my friend described this type of language to me and I implemented it.
24.
▲
by
ret2pop
3y ago
I am not generally knowledgeable about Forth and languages like it because the only experience I have writing in anything close to forth is in my own language. Thanks for explaining.
25.
▲
by
ret2pop
3y ago
I've updated the blog to include a short explanation of it.
26.
▲
by
ret2pop
3y ago
Writing that part right now
27.
▲
by
ret2pop
3y ago
correct me if I am wrong, but from my knowledge concatenative programming often assumes a different syntax for defining words. Usually it looks something like : add a b + ; if I am not mistaken.
28.
▲
by
ret2pop
3y ago
Yes, you are correct. My friend made this post so I didn't have control over the exact wording. That being said, in concatenative programming, the stack is public and, in my case, is virtual.
29.
▲
by
ret2pop
3y ago
I'm kind of just using words. You can call it whatever you want, I just used words that my friends also used to describe what I wrote. Really, loading custom libraries from C is really easy but I decided to advertise that part of the p
30.
▲
by
ret2pop
3y ago
Yes. I have realized this. I added a meta tag to the website recently, I don't know if that solves the problem. I don't know much about css really. Edit: temporary fix of simply hiding the sidebar. lol.
More ›