transforms

A number of transforms to lisp syntax, mostly infix. I'm just calling them transforms for now, syntax extensions might be a more accurate term.

This process occurs before macroexpansion, so everything looks as it was before by the time it arrives at the macro. Yes, this clobbers certain variables, until I get lexical variable analysis up and running.

Currently only works on sbcl, might port to other implementations if the need arises.

The ones marked (todo) are unimplemented, just started on this project. Ideas for new transforms/syntax extensions more than welcome.

usage

enable-transforms [transforms] transform-name(s)

transforms

right-arrow-lambda

(mapcar (x y -> (+ x y)) '(1 2 3) '(4 5 6)) => (5 7 9)

left-arrow-bind (todo)

(and (bar <- (really-long-cond foo)) 
     (qux <- (other-really-long-cond baz))
     (+ foo bar))
   
(defun foo (bar baz)
   (qux <- (apply baz bar))
   (list qux bar))

(if (> 6 (value <- (gethash key table))) 
   (print value) 
   (error "whoops"))

hole-lambda

Turns forms with "<>" into lambda statements. Does not yet use lexical or type information, so only works on a single level.

normal usage:

(map (+ 10 <>) '(1 2 3)) => (11 12 13)

(reduce #'max list :key (gethash <> table))

positional lambda:

(filter (foo <2> <1>) list)

haskell-type-decleration (todo)

Also usable with a variable in the left side, and a single type.

(fibo :: integer -> integer)
(defun fibo (n)
   (if (n < 2)
       n
       (fibo (n - 2) + fibo (n - 1))))

dependencies and installation

Depends on two of my own libraries not in quicklisp, provide-toplevel and destructuring-match, both of which can just be cloned into local-projects.

This project requires quicklisp to run. To install quicklisp, head over to quicklisp's website and follow the instructions there. Make sure you run (ql:add-to-init-file), otherwise quicklisp won't be avaliable when you start your interpreter.

To use it, clone this repo into ~/quicklisp/local-projects, and run (ql:quickload 'provide-toplevel).