Alex Knauth
Alex Knauth
The optional `fill` argument should not default to "contents are unspecified", but either `#f` or `0` or null or whatever makes the most sense for each datatype. These can be...
The `Boxof` type now has two forms: - `(Boxof t)`, a type for boxes that can contain values of type `t`. You can write `t` values into the box with...
### What version of Racket are you using? Racket version 8.1 with `typed-racket-lib` version 1.12. ### What program did you run? ```racket #lang typed/racket (module untyped racket (provide (struct-out a)...
Allows patterns inside `list-no-order` to refer to nonlinear patterns declared prior, such as in `(cons a (list-no-order a rst ...))`. Includes nonlinear patterns declared under ellipses, such as in `(list...
An implementation of https://github.com/racket/rhombus-prototype/pull/225 option A: Rests with `&` and `~&`, Repetitions with `...`, Strings with `+&`. Things left to do: - [x] Implement keyword-apply-like function calls with `~&` keyword...
Adds a markdown document with a design proposal for `&` rest arguments and `~&` keyword rest arguments, as well as their potential interaction with `[]`/`{}` data constructors and `...` ellipses....
Takes a single list argument because that's what at-expressions with `{}` expect. ``` > str(["the list ", [1, 2, 3], " has ", 3, " elements"]) "the list [1, 2,...
For how to write built-in data structures with reader syntax rather than function calls. Current examples compound data literals in Racket include `#hash([a . 1] [b . 2] [c ....
For example in a function application macro: ```racket (define-typed-syntax app [(_ f a ...) ≫ [⊢ f ≫ f- ⇒ (~→ τ_a ... τ_out)] ....] [(_ f a ...) ≫...