| -1721167845 | | Infix Expressions This package needs license metadata | succeeds | 2 |
| -1643996628 | | Simple but versatile infix parsing for arbitrary expressions. Fully customizable. Comes with basic math expressions implemented. This package needs license metadata | succeeds | 2 |
| -1734608969 | | Scheme+ for Racket : infix notation with operator precedence, overloading for binary and n-arity operators and for procedures.
To use the curly infix syntax of SRFI 105 begin your program by:
#lang reader SRFI-105
the file is in the archive package or can be retrieved here:
https://github.com/damien-mattei/Scheme-PLUS-for-Racket/tree/main/src
| succeeds | 0 |
| -1734915071 | | Scheme+ for Racket R6RS version.
Infix notation with operator precedence, overloading for binary and n-arity operators and for procedures.
Designed to be used with SRFI 105 Curly Infix aslo available as a package. | succeeds | 0 |
| -1734605392 | | SRFI 105 Curly Infix | succeeds | 0 |