sweet-expressions is an actively used programming language created in 2013. This SRFI describes a set of syntax extensions for Scheme, called sweet-expressions (t-expressions), that has the same descriptive power as s-expressions but is designed to be easier for humans to read.

7Years Old ?Users ?Jobs

Example code from the web:

define fibfast(n)   ; Typical function notation
  if {n < 2}        ; Indentation, infix {...}
     n              ; Single expr = no new list
     fibup n 2 1 0  ; Simple function calls

Last updated August 9th, 2020

Edit sweet-expressions on GitHub