Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
one-punch
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
10 ms
·
61.
▲
by
one-punch
6y ago
While I agree that science should aim for replicability (same result for similar methods on the same scientific question) instead of reproducibility (same methods) [1], it does not hurt to let others to reuse part of your research pipeline.
62.
▲
by
one-punch
6y ago
You might be interested in using Guix [1] for reproducible research, as is reported earlier (for genomics analysis) [2] and still actively developed [3]. As a bonus, Guix and Nix [4] allow for modular and composable pipelines, where you can
63.
▲
by
one-punch
6y ago
The integration with fzf seems nice. Any plans to integrate with skim, a Rust implementation of fzf? https://github.com/lotabout/skim
64.
▲
by
one-punch
6y ago
An expressive language should let programmers reason about code, including parsers, for their correctness. You know it is correct when you see it, and you get more confidence in not making silly mistakes with unit tests. This is a different
65.
▲
by
one-punch
6y ago
Parser combinators showed me what an expressive language (in particular Haskell) can do to let you write code as you intend, so that maintainable code is enjoyable to read, write, and reason about. I have heard that some people first “get”
66.
▲
Nix(OS) Thoughts
(blog.knightsofthelambdacalcul.us)
2 points
by
one-punch
6y ago
|
0 comments
67.
▲
by
one-punch
6y ago
> This might be true, but when they were making the case for constructive types they didn't mention it. Agree. > The discussions seems to be mostly dependent types vs refinement types, which I'd argue is a false dichotomy. Y
68.
▲
by
one-punch
6y ago
> While this is true, I'm not sure how constructive types don't face the very same issue. Not sure if the author claims that constructive types do not face this issue. On constructive types vs refinement types, there is a recen
69.
▲
by
one-punch
6y ago
> arbitrary properties are very difficult to check in general. To add to this: In theory, it is not just difficult, but impossible . Imagine that the refinement predicate is whether the String/Text encode a (non-)halting Turing mac
70.
▲
by
one-punch
6y ago
The justification from the article: "To some readers, these pitfalls may seem obvious, but safety holes of this sort are remarkably common in practice. ... Proper use of this technique demands caution and care: * All invariants must be
71.
▲
by
one-punch
6y ago
For those who may not be familiar with the Haskell ecosystem, Alexis King (lexi-lambda) writes many blogs and libraries related to Haskell. For example, you may be interested in her recent talk on effect systems in Haskell at ZuriHac 2020,[
72.
▲
by
one-punch
6y ago
For me, the remaining power of optics (what you call 20%): 1. let the compiler reason about my code to catch errors when the requirement changes (say, when some record fields change their names or types), 2. thus lower my cognitive load, an
73.
▲
Voice Controlled Animations
(reanimate.readthedocs.io)
3 points
by
one-punch
6y ago
|
0 comments
74.
▲
by
one-punch
6y ago
I believe this library would be very useful for simple animations. The small size and simple API should make this usable in many cases. As for more sophisticated animations, I can think of reanimate [1], which outputs animations in SVGs, an
75.
▲
by
one-punch
6y ago
It produces structured data (the `MarkupM` datatype from `blaze` to be precise [1]). To check this, note that Hamlet produces `Html` [2], which (when following the link) is defined to be `Markup` [3], which is in turn `MarkupM` [4]. [1]: h
76.
▲
by
one-punch
6y ago
Reminds me of the “Shakespearean Templates“ [1] from the Yesod web framework [2]. [1]: https://www.oreilly.com/library/view/developing-web-applicat... [2]: https://www.yesodweb.com/ Copied below t
77.
▲
by
one-punch
7y ago
The code is mostly pure Haskell (the do block, which most Haskellers are familiar with), with a few domain-specific elements (those led and delay “assignments” and the Stream type in this functional reactive programming framework ar
78.
▲
by
one-punch
7y ago
My understanding is that the domain-specific language (which is embedded in Haskell) generates C code, which is then compiled to an arduino binary. The key sentence: > This whole example turns into just 63 lines of C code, which compiles
79.
▲
Convicted Murderer Says Life Sentence Was Served When He Died and Was Revived
(newsweek.com)
1 points
by
one-punch
7y ago
|
0 comments
80.
▲
by
one-punch
7y ago
There is a cute name for, er, the two ways of naming systems: pets naming vs cattle naming [1]. I think naming after services is like pet naming, while naming them by numbers is like cattle naming. Pets Service Model In the pets service mod