Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
vrnvu
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
13 ms
·
151.
▲
by
vrnvu
5y ago
Location: Spain Remote: Yes Willing to relocate: No Technologies: AI, ML, python, java, typescript, golang, vim, git, docker Résumé/CV: https://tinyurl.com/5wztwaf6 / https://github.com/vrnvu Ema
152.
▲
by
vrnvu
6y ago
The writting style reminded me of the famous tao of programming: https://www.mit.edu/~xela/tao.html
153.
▲
by
vrnvu
6y ago
I find interesting their approach on how to compare the implementation complexity for the developer between the langauges. I quote, State management, "code that is used to save temporary data required by the ongoing coordination proces
154.
▲
by
vrnvu
6y ago
In a simple example like the author provided maybe is not that obvious but try to imagine an example with a more complex nested syntax and maybe some threading or function composition in it. If you have to modify the behaviour of a specific
155.
▲
by
vrnvu
6y ago
If you are new into lisp I highly recommmend you htdp2. It also uses subsets of racket to teach. I love how it teaches the fundamentals of programming. Simple and clean. https://htdp.org/2018-01-06/Book/
156.
▲
by
vrnvu
6y ago
A great way to put it indeed. This applies so well in a huge diversity of hierarchies (social constructs) where any manifestation of power is involved. Also reminds me of the famous poker phrase: "If You Can’t See the Sucker, You’re It
157.
▲
by
vrnvu
6y ago
Let me google the rule for those of you reading. "Any sufficiently complicated C or Fortran program contains an ad hoc, informally-specified, bug-ridden, slow implementation of half of Common Lisp."
158.
▲
by
vrnvu
6y ago
A similiar idea related to learning is how we build knowledge, how we actually learn and what are those steps. Consider learning as a procedure to build a tree of ideas and relationships between them that you want to use. We can take a bott
159.
▲
European enterprise survey on the use of artificial intelligence
(ec.europa.eu)
1 points
by
vrnvu
6y ago
|
0 comments
160.
▲
by
vrnvu
6y ago
In recent years there has been a lot of improvement in refinement types which is, from what I understood, what you are describing. See for example Liquid Haskell that uses Z3 solver for static verification. https://ucsd-progsys.g
161.
▲
by
vrnvu
6y ago
Also I personally recommend to take a look to this series before diving into his great introductory book about category theory [1]. Seeing the application of the theoretical concepts and deriving the code yourself makes it more approachable
162.
▲
by
vrnvu
6y ago
Lately I've been into what I would call "the classics", Knuth, Peter Norvig, Minsky, Dijkstra... I realised most of what nowadays is called modern software/techniques basically consist in re-framing old essays from them.