Support “curly-infix-expression” notation as a reader Some existing developers who use Scheme, and it would alsoīy developers who currently choose to use other languages instead.Įxtensions to the language”. Infix notation is taught to most people (programmers or not) in school,Īnd nearly all new programming languages include infix.Īdding infix support to Scheme would be a useful convenience for Infix is not going away standard mathematical notation uses infix, The world to use Esperanto than prefix notation” Paul Prescod has said, “I have more faith that you could convince Even some Lisp advocates, like Paul Graham, admit thatĭecades of experience with Lisp-based languages. Programming languages in modern use that do not support infix Top of this SRFI, but curly-infix-expressions are useful on their own. We intend to later submit at least one additional SRFI that will build on Introduces a list whose visual presentationĬan be in infix order instead of prefix order.īy intent, there is no precedence, but e.g.,įorms with mixed infix operators and other complications haveĪlso, inside a curly-infix list (recursively),Įxpressions of the form f(. It is an abbreviation in much the same way that To support “curly-infix-expression” notation as a homoiconic “for possible future extensions to the language”. In part because they miss these conveniences. This SRFI provides these capabilities, both forĭevelopers who already use Scheme and want these conveniences,Īnd also for other developers who may choose to use other languages In addition, most languages allow infix expressions to be combined Programming languages in modern use that do not support infix notation. Lisp-based languages, like Scheme, are almost the only You can access previous messages via the mailing list archive. To subscribe to the list, follow these instructions.

To provide input on this SRFI, please send email to. Here is an explanation of each status that a SRFI can hold.

Racket file peek char