Daniel Hillerström
Daniel Hillerström
Following #900 we should disallow empty block expressions. Currently the following expression ```links fun() { } ``` desugars into ```links fun() { () } ```
Shadowing of let-bound names is broken in the REPL, when some redefinition of a let-bound name makes use of the previous definition. A few examples ``` links> var x =...
@jamescheney's comment on #966 prompted me to look into places where we parse, use, and reconstruct database arguments strings. To my surprise it turns out each database driver is equipped...
During the refactoring of the type structure #637 we collapsed the type structure into a single monolithic data type. This change trades static well-formedness guarantees in favour of making the...
This proposal is about providing lightweight syntax for partial application of `n`-ary function application for `n > 1`. ## What: Partial application Links supports partial application of curried functions, e.g....
In using Links' first-class polymorphism I have stumbled upon what appears to be a curious interaction amongst the type checker, type inference engine, and the unification engine. Consider the following...
Continuation of #869/#908 which implements switch functions for uncurried functions.
Lately, I have been working on making the internal handling of names hygienic in the compiler. I have coupled this work with the introduction of compilation units (#603). At this...
The task is to implement shallow n-ary handlers (also called multi handlers), as found in [Frank](https://github.com/frank-lang/frank), and deep n-ary handlers with my generalised semantics, that let multi handlers simulate parameterised...
What's the semantics of alien ground values? For example, one can conceive of the following program: ```links alien javascript "val.js" foo : Event; var x server = foo; fun mainPage(_)...