yiransheng

8 ms·

1.
by yiransheng 3y ago
Trying to compile Basic is actually a bit trickier than just implementing an interpreter indeed. Like the FOR statement example you mentioned. Another messy situation is non-lexical FOR/NEXT like here [1], where NEXT can be encountered
2.
by yiransheng 3y ago
What you described is called Continuum hypothesis[1]. Surprisingly it cannot be proven to be either true or false from(is independent of) ZFC set theory. [1] https://en.m.wikipedia.org/wiki/Continuum_hypothesis
3.
by yiransheng 7y ago
This number is the result of a "large number duel"[1] between MIT Associate Professor Agustin Rayo (The Mexican Multiplier) and Princeton Associate Professor Adam N. Elga (Dr. Evil)[2]. Possible the world record largest number by
4.
Rayo's Number(googology.wikia.org)
3 points by yiransheng 7y ago|2 comments
5.
Googology Wiki: database of large numbers and fast-growing functions(googology.wikia.org)
1 points by yiransheng 7y ago|0 comments
6.
Reverse Emulating the NES to Give It Super Powers(youtube.com)
3 points by yiransheng 7y ago|0 comments
7.
Show HN: Basic_rs, BASIC Interpreter/Compiler(to wasm/js/rust)(github.com)
4 points by yiransheng 8y ago|0 comments
8.
by yiransheng 8y ago
I would recommend check out urealms[1]. It is a improv/role playing show running on rules similar (but simplifed) DnD rules. The format is a group of twitch personalities steam their gameplay for a live audience, contents including imp
9.
by yiransheng 8y ago
Oh nice. I have been writing a BASIC bytecode interpreter (and a compiler for WebAssembly)[1] in Rust. It's a bit slower to get rolling than Python - especially function value representation and dynamic dispatch, unlike Python, could n
10.
by yiransheng 8y ago
Hooks reminds me of tensorflow scopes a little bit, in python: with tf.variable_scope("foo"): with tf.variable_scope("bar"): v = tf.get_variable("v", [1]) assert v.name ==
11.
Show HN: Pie Chart Label Layout with Graph Algorithms (and Rust)(yiransheng.github.io)
3 points by yiransheng 8y ago|0 comments
12.
Chess AI LeelaChessZero Defeated in a Bullet Game by Andrew Tang(clips.twitch.tv)
2 points by yiransheng 8y ago|1 comments
13.
by yiransheng 9y ago
In this case, I think Java's lack of tuples adds quite a bit of syntactic noise, a similar version in rust (another language with method chaining based iterators): let generated: Vec<i32> = itertools::iterate((0, 1
14.
by yiransheng 9y ago
Really impressed! Took a quick look at page source, a couple of observations on why it's fast: 1. Plain, small html - page size is 6.1 kb (request took 700ms for me, I guess the server side rendering is pretty fast too), css file 11kb;
15.
by yiransheng 9y ago
The list of niceties of lua from the article: > First class functions and closures > A versatile data structure: the table > Vararg expressions > Lexical scoping > Iterators > Coroutines (see below) Well, looking at modern
16.
by yiransheng 9y ago
Interesting mention of create-subscription[1], first time I have heard of such a library/api. Seems it's part of official react repo. Looks like a great piece of utility for interfacing rxjs/xstream etc. Observables. I guess
17.
by yiransheng 9y ago
Finally, `d3.create`[1] - it has been a minor pain pointer in d3 to create a detached selection for quite some time :) [1] https://github.com/d3/d3-selection/blob/master/README.md#cre...
18.
by yiransheng 9y ago
Prettier is such an awesome tool! The best part of it is formatting jsx code - being a mixture of xml and js code, formatting it manually is such a pain. Incidentally, the existence of prettier is also a major reason React stack is my goto
19.
by yiransheng 9y ago
Some personal thoughts: the key for me at least, is a bit like the hammer-nail mentality. An software engineer for example has a (small) mathematical toolkit (a hammer), sometimes forcing your problem at hand into the shape of nail is suffi
20.
CRDTs: Distributed Semilattices (2014)(blog.plasmaconduit.com)
2 points by yiransheng 9y ago|0 comments
21.
by yiransheng 9y ago
In languages like Haskell and Scala that supports `do` / `for` comprehension sugar, this could be done without the nesting: fn :: Maybe Int -> Maybe Int -> Int fn q z = fromMaybe 0 $ do q_in <- q z_in &l
22.
by yiransheng 9y ago
In FP world, there's a somewhat advanced solution to this, Free Monad DSL/Interpreter pattern. I first found out about it in this talk: [ https://www.youtube.com/watch?v=fU8eKoakd6o](https://www.you... . T
23.
by yiransheng 9y ago
ES6+ javaScript in absorbed many great features from python: destructuring vs. tuple unpacking, spread (...) vs *args argument unpacking and generators. Many things I enjoyed in python are now also idiomatic javaScript. Only thing missing i
24.
by yiransheng 9y ago
Inheritance based OOP models tree-like entites well, where hirachy is defined and clear cut. Unfortunately, lots of real life domains are best expressed by graphs - commonly a DAG. You need to pay attention to your edges and not just the no
25.
by yiransheng 9y ago
Also plottable, one of the few large typescript open source libraries you can depend upon.
26.
by yiransheng 9y ago
With algebraic data type like in Haskell, the state could be typed like this: data State a = Loading | Failed | Loaded [a] Compared to a representation like `{ loading:true, error: false, pics:[] }`, the above mo
27.
by yiransheng 9y ago
Calmm-js is one of these: https://github.com/calmm-js
28.
Belief, bias and Bayes(theguardian.com)
2 points by yiransheng 12y ago|0 comments
29.
Nixie Is a Wearable Camara Drone That Can Unfold Off of Your Wrist(simplebotics.com)
2 points by yiransheng 12y ago|0 comments
30.
iPhone 6 data encryption puts NSA in a quandary: US Federal Agencies Unhappy(capitalotc.com)
1 points by yiransheng 12y ago|0 comments

More ›