sweet-expressions

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

• the sweet-expressions website
• sweet-expressions first appeared in 2013
• sweet-expressions was created by David A. Wheeler and Alan Manuel K. Gloria
• Have a question about sweet-expressions not answered here? Email me and let me know how I can help.

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 May 25th, 2020

Edit sweet-expressions on GitHub