Ported @edwinbrady's Idris merge sort to Agda. Agda code runs 4x faster and doesn't segfault on long lists.https://gist.github.com/UlfNorell/4325f091c4f4fbcbad2581577a4f2903 …
-
-
Replying to @ulfnorell
.
@ulfnorell I suppose it's time we wrote a proper run time system… the C calling convention isn't really up to this sort of program.2 replies 2 retweets 10 likes -
Replying to @edwinbrady
Oh, I should add, "Challenge accepted". I'm not going to let this state of affairs last too long :). /cc
@ulfnorell3 replies 3 retweets 20 likes -
Replying to @edwinbrady
@edwinbrady How does the unchecked version on Idris compare to the checked one?@ulfnorell1 reply 0 retweets 0 likes
Replying to @_m_b_j_
@_m_b_j_ Pretty much the same. From my limited prodding, it's the overhead of the C RTS, which prioritises simplicity not speed @ulfnorell
10:26 AM - 3 May 2016
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.