Be the first to post a text review of LiLi. Rate and review a project by clicking thumbs up or thumbs down in the right column.

View all reviews

• littlisp LiLi 0.30 file released: lili030.zip

  posted 1476 days ago

• File released: /littlisp/LiLi 0.30/lili030.zip

  posted 1476 days ago

• Lili 021r4 released / Help Wanted

  Lili has gone a long way since release 011. The new version (021) is significantly faster (2.5-3x faster than JScheme 1.4) and supports some nice new features like pattern-matching, lexical closures (although principally dynamically scoped), and implicit closuring. Work on a documentation is in progress. See littlisp.sourceforge.net for an under-construction-homepage. Unfortunately Lili has became a one-person project. Any help would be great!

  posted by littledreams 1671 days ago

• littlisp lili 021 (release 4) file released: lili.jar

  -bug fixing

  posted 1671 days ago

• File released: /littlisp/lili 021 (release 4)/lili.jar

  posted 1671 days ago

• littlisp lili 021 (release 3) file released: lili.jar

  -bug fixing

  posted 1672 days ago

• littlisp lili 021 (release 2) file released: lili.jar

  -extended macro support: now macros may have a non-static number of arguments by using pattern matching in their definition. new example for a case macro: ;the case macro: (defun case-eq (e1 e2) (cond ((eq e2 'else) t) (t (eq e1 e2)))) (defun eq-alize (var) (lambda (case) (list (list 'case-eq var (car case)) (cadr case)))) (defmacro case (*cons* var (*cons* casefirst caserest)) (let (eqv (eq-alize var)) (cons 'cond (cons (eqv casefirst) (map eqv caserest)))) | case (x) (throw-ex "CASE-ERROR:" x) ) (defun test-case (x) ;a silly test function for the case macro (case x (1 "one") (2 "two") (3 "three") ('else "something else")) ) ;end case macro

  posted 1675 days ago

• littlisp lili 021a file released: lili.jar

  -added macro support (only macros with a fixed number of arguments are allowed) an example for a case macro: ;the case macro: (defun case-eq (e1 e2) (cond ((eq e2 'else) t) (t (eq e1 e2)))) (defun eq-alize (var) (lambda (case) (list (list 'case-eq var (car case)) (cadr case)))) (defmacro case (var cases) (let (c cases) (cons 'cond (map (eq-alize var) cases)))) (defun test-case (x) ;a silly test function for the case macro (case x ((1 "one") (2 "two") (3 "three") ('else "something else")) )) ;end case macro -left the path of pure dynamic scoping. Added support for *lexical* closures. Use the special form lexlambda instead of lambda to create a closure. A primitive example: (defun curry-add-4 (x) (lexlambda (x') (lexlambda (x'') (lexlambda (x''') (+ x (+ x' (+ x'' x'''))))))) Playing with the example: lili > (((curry-add-4 1) 2) 3) #<CLOSURE: (x''') -> (+ x (+ x' (+ x'' x''')))> lili > (rewrite-closure it) (lambda (x''') (+ 1 (+ 2 (+ 3 x''')))) lili > (it 4) 10 lili > ((((curry-add-4 1) 2) 3) 4) 10 lili > -these are all changes.

  posted 1675 days ago

• littlisp lili 020b file released: lili.jar

  -general bug fixing -ugly bugs fixed in the swing console -improved evaluation routine for pattern matching functions - much faster now. -some overall acceleration -improved exception handling

  posted 1676 days ago

• littlisp lili 020a file released: lili.jar

  -much faster (as long, as there's enough memory available: about twice as fast as jscheme) ! -many new features (eg: built-in pattern matching, new built-in functions, implicit reduce eval for binary functions, an exception datatype, new organization of the Lisp-/Java meta-communication level within an api called "symbiosis", etc)

  posted 1683 days ago