14:58:12lisbethsI have been a bad lisp programmer I have been reading ML
14:58:32lisbethsif lisp has a fixed number of arguments then you don't need The parentheses
14:58:54lisbethsdefine add lambda x lambda y + x y add 2 2 => 4
15:00:01lisbethsdefine factorial lambda x if eq x 1 1 + 1 factorial - x 1
15:01:33jackdanielthis beauty combines the readibility of APL with conciseness of Java; go for it
15:02:09lisbethsI want to make a version of schemes like this but I want it to be able to be purely reversible and so I have to give up tail call recursion optimization
15:02:41lisbethsI also want the interpreter of this to fit into the boot sector of a floppy like sector lisp or sector 4th and I can actually implement this in both sector list and in sector 4th
15:02:47jackdaniellike: 1 x - lairotcaf 1 + 1 1 x qe fi x adbmal lairotcaf enifed
15:03:50lisbethsI'm thinking of this as like an ml but that's closer to scheme
15:04:42lisbethsI think your example Jack Daniel would have to mean that the number one could take an argument otherwise what that would do is return one and then immediately begin calculating as if x were a function that needed to take an argument otherwise it would be a syntax error
15:05:08jackdanielmy nick is not "Jack Daniel", and my example was a joke regarding reversibility
15:06:18lisbethsI didn't understand your joke and I'm typing through Google voice typing