gergoerdi

9 ms·

31.
by gergoerdi 9y ago
Non-Recursive Make is also Considered Harmful: https://news.ycombinator.com/item?id=11441719 In seriousness, the linked paper describes Shake, a Make replacement with two party tricks: one, it is implemented as a DSL embedd
32.
by gergoerdi 9y ago
I've used Krakatau, a JVM assembler / disassembler written in Python, to good effect in a project: https://github.com/Storyyeller/Krakatau
33.
by gergoerdi 9y ago
We need much more of #3 than what we have. In relative terms, it seems #3 is shrinking on the Internet over the decades.
34.
by gergoerdi 9y ago
That is a much more complicated question than you make it sound: https://cstheory.stackexchange.com/q/5245/1802
35.
by gergoerdi 9y ago
Check out MagicHaskeller which figures out list processing functions from examples: http://nautilus.cs.miyazaki-u.ac.jp/~skata/MagicHaskeller.ht... For example, given the rule `f "abcde" 2 == "aabbccddee
36.
Rust on AVR: Beyond Blinking(gergo.erdi.hu)
3 points by gergoerdi 9y ago|0 comments
37.
by gergoerdi 9y ago
The real version of this is https://publications.lib.chalmers.se/records/fulltext/234939... : Ethereum contracts written in an Idris-embedded DSL.
38.
by gergoerdi 9y ago
Young Adult Fiction.
39.
by gergoerdi 10y ago
I guess that would be the Eonia: "Eonia reference rates are calculated by the European Central Bank, based on all overnight interbank assets" https://en.wikipedia.org/wiki/Eonia
40.
by gergoerdi 10y ago
I once did an introductory talk to Agda that was structured around solving the MU problem, i.e. proving that MU is not derivable in MIU: https://unsafePerform.IO/projects/agda/sg-meetup/SGMeetup.pd... (the MI
41.
by gergoerdi 10y ago
The "F" in RTFM stands for "First": http://uncyclopedia.wikia.com/wiki/RTFM
42.
by gergoerdi 10y ago
Of course? If you want to recover 'not believing outright falsehoods' from that, just assign a very high value to 'truth' in your utility function.
43.
by gergoerdi 10y ago
There's the so-called 'B Method', which seems very similar to this on the programming language side. I haven't checked the proof language so that may be very different. I've got a two-parter on my blog giving a glim
44.
by gergoerdi 10y ago
No, because those commits are still reachable from the reflog.
45.
by gergoerdi 10y ago
Sounds like the DARPA Shredder Challenge from 2011: https://en.wikipedia.org/wiki/DARPA_Shredder_Challenge_2011
46.
by gergoerdi 10y ago
As I mentioned in another comment, there are applicative parser combinator libraries for regular languages, e.g. https://hackage.haskell.org/package/regex-applicative so asymptotic speed is orthogonal to 'combinat
47.
by gergoerdi 10y ago
Depends on the parser combinator library. Real regexes can be matched in time linear in the input size; you'll need to use an applicative parser combinator like regex-applicative ( https://hackage.haskell.org/package&#x2
48.
by gergoerdi 10y ago
The Metamorphosis of Prime Intellect: http://localroger.com/prime-intellect/
49.
by gergoerdi 10y ago
Note that e.g. Agda uses unary representation of natural numbers during typechecking, but then compiles them to `BigInt`s to avoid exactly this kind of slowdown due to a representation that is well-suited for proofs.
50.
by gergoerdi 10y ago
In my experience [building my own Commodore PET on an FPGA]( https://gergo.erdi.hu/blog/2015-03-02-initial_version_of_my_... ), the PET would be a very promising candidate for using this as a plug-in replacement, since t
51.
by gergoerdi 10y ago
Wait what? The whole point of dependetly-typed languages is that programs you write in them are fully typechecked at compile time.
52.
Register Machine implemented at the type-level of Haskell(github.com)
3 points by gergoerdi 11y ago|0 comments
53.
by gergoerdi 11y ago
> you also have to understand your opponent This could be a dangerous idea. http://lesswrong.com/lw/x4/nonperson_predicates/
54.
by gergoerdi 11y ago
But a good lecture is exactly one that enables you to do the prediction/explanation/result checking feedback on your own . For example, a good maths lecture is one where you can always have an idea of what you would do for the ne
55.
by gergoerdi 11y ago
`comm -1 -3` ( http://pubs.opengroup.org/onlinepubs/9699919799/utilities/co... ) is practically made for quickly finding who is a member of all involved groups.
56.
by gergoerdi 11y ago
https://en.wikipedia.org/wiki/Metonymy
57.
by gergoerdi 11y ago
As always, prefer prebuilt recursion scheme combinators instead of making your own. The following, using `forever`, is IMO much more readable because you don't have to mentally resolve the recursion: main :: IO () main = withFile
58.
by gergoerdi 11y ago
Does the background show Singapore's Marina Bay for everyone else, or is it based on IP geo-location? (obligatory "I can see our house from here!")
59.
by gergoerdi 11y ago
Here's an example where I used, if not the Yoneda lemma, its categorical dual the co-Yoneda lemma (named `MarketRequest` in this post because I didn't know about it at that point so had to reinvent it to my particular use case) to
60.
by gergoerdi 11y ago
You can also do time-travelling control structures: https://hackage.haskell.org/package/tardis-0.3.0.0/docs/Cont...

More ›