Anton Felix Lorenzen
Anton Felix Lorenzen
The idea is to decouple the graph creation functions from the actual graph creation. In code: ```haskell data SubGraph a = Vertex a | Clique [a] | Biclique [a] |...
Right now the Asterius version of [naproche](https://github.com/naproche/naproche) is roughly 3x as slow as the GHCJS version and roughly 30 times as slow as on the command line. Is this normal/expected?...
When installing the current `dev` branch using the `util/install.sh` script as detailed in the README, Koka seems to use the std/ modules from a separate madoko installation. As the madoko...
Place the following code in three files (a.kk, b.kk, c.kk): ``` module a public alias node = int module b import a private struct xyz { field : node }...
Koka v. 2.1.9 fails while compiling this merge function: ``` module haskell-sort alias elem = int fun merge(as_ : list, bs_ : list) : list { match(as_, bs_) { (Cons(a,...
Given the following part of a Koka translation of Haskells `Data.List.sort`: ``` module haskell-sort alias elem = int fun sequences(xs : list) { match(xs) { Cons(a, Cons(b, xs)) { if(a...
You can find a fairly short Koka implementation of heapsort based on Binomial Heaps (as discussed by Okasaki) here: https://gist.github.com/anfelor/f6d6e437d9d47f77534cace1904bbe5e (I couldn't reduce this further; this is a tricky bug!)...
Place the following file into 'testsuite.kk': ```module testsuite import std/num/int32 import std/time/timer struct test-config { testsize : int max-rand-number : int32 } fun print-test-config(tc) { println("Heapsorting " ++ show(tc.testsize) ++...
Consider the following implementation of weight biased leftist heaps as in section 3.1 of Okasaki (though the details aren't important): ``` import std/num/int32 alias elem = int public type heap...
It can happen that koka code type-checks, but does not compile: ``` module test type pipe { PipeM { action : () -> e pipe } } fun unconsM(p :...