Better Syntax

[wilbowma]

If the point of Cur is notation, then infix syntax is important. Parsing s-expressions is easy for computers, but humans are quite good at parsing mixfix notation. It can be very information dense, which can be useful for reading/writing complex proofs and specifications.

With some advanced reader extensions, which seem possible in Racket (e.g. sweet-expression reader), perhaps we can support Agda-like syntax and mixfix notation.

[wilbowma]

https://github.com/mromyers/octavo

[rodlogic]

https://lexi-lambda.github.io/blog/2017/08/12/user-programmable-infix-operators-in-racket/