Menu

Show posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Show posts Menu

Topics - Kazimir Majorinc

#41
newLISP newS / Lispeln - Newlisp fork.
February 12, 2010, 05:07:00 AM
(not my - I just seen it on net)



https://launchpad.net/lispeln">https://launchpad.net/lispeln
#42
http://www.instprog.com/newlisp-forum-members/newlisp-forum-members.png">



If you joined the forum, the chance that you'll post is ~ 70%.

If you posted n posts on forum, chance that you'll post 2n posts is ~ 70%, for each n.
#43
At
  • [*]http://www.shortnotizer.com/">Shortnotizer, http://newlispfanclub.alh.net/forum/viewtopic.php?f=9&t=2654&p=14910&hilit=shortnotizer#p14910">already presented on the forum

  • [*]http://www.amibile.com/">Amibile gallery, made in Newlisp.

  • [*]Few Newlisp unrelated projects.
  • [/list][/color]
    #44
    Project site: http://bitbucket.org/nikhilm/newlisp-redis/overview/">http://bitbucket.org/nikhilm/newlisp-redis/overview/
    #45
    http://github.com/mtakuya/gauche-nl-lib">http://github.com/mtakuya/gauche-nl-lib
    #46
    Aparecido Valdemir de Freitas , João José Neto

    Conception of Adaptive Programming Languages

    Scholarly conference paper



    http://www.pcs.usp.br/~lta/artigos/aparecido-iasted2006.pdf">http://www.pcs.usp.br/~lta/artigos/apar ... ed2006.pdf">http://www.pcs.usp.br/~lta/artigos/aparecido-iasted2006.pdf
    #48
    newLISP in the real world / Using parentheses in symbols.
    November 19, 2009, 08:32:20 AM
    Is there a chance that one of the [] and {} is released of its duty on a meta level and allowed to be the part of legal symbols? I think that at least one parentheses could be left for that purpose. {}'s are currently used for {hi"ho"he} instead of "hi"ho"he", although it doesn't appear that it is very important, and [text]hi"ho"he[/text] already does the same.
    #49

    • http://unbalanced-parentheses.nfshost.com/newlispbayesiancommentspamkiller">http://unbalanced-parentheses.nfshost.c ... spamkiller">http://unbalanced-parentheses.nfshost.com/newlispbayesiancommentspamkiller
    • [/list]

      Cormullion is too modest to promote his articles, but this might be good place for every NL related link, people like alive communities poll said. Two questions:


      [list=a]
    • (1) Cormullion, we have only one way to read your old posts at the moment - random. Is it right?

      (2) Cormullion and others, do you get lot of spam on your blog? I never got one (on blogspot com).
    • [/list]
    #50
    "... Besides messing around with the obvious web/cgi stuff with it, I wrote a scraper and ported an implementation of the ARC4 encryption scheme."



    http://l073k.blogspot.com/2009/11/newlisp.html">http://l073k.blogspot.com/2009/11/newlisp.html
    #51
    Few proposals:



    * traditional for, so (for(i 2 1) ... body ... ) doesn't evaluate body. For example, I just tried to write program that test prime numbers, and typically it should have the following code:


    (for (i 2 (- n 1))
      (if (= (mod n i) 0) ...


    but it doesn't work for n=2, it must be treated as a special case. It is not good. Maybe traditional for can be named for*.



    * Also, few simple predicates: positive?, negative?, (divisible? i j) All three replace simple phrases, nevertheless, it is easier to think in terms (divisible? i j) than (= (% i j) 0), especially (clean positive? L) instead of (clean (lambda(x)(> x 0)) L)
    #52
    Dont believe me! Just check what  http://www.google.com/search?q=producer+Lutz+M%FCller">Google said about that.
    #53
    (define (crawler-tractor )
       (begin (println "Hi for the " (inc counter) ". time. ")
              (push (last crawler-tractor) crawler-tractor -1)
              (when (> (length crawler-tractor) 3)
                    (pop crawler-tractor 1))))


    works indefinitely, but


    (define-macro (crawler-tractor )
       (begin (println "Hi for the " (inc counter) ". time. ")
              (push (last crawler-tractor) crawler-tractor -1)
              (when (> (length crawler-tractor) 3)
                    (pop crawler-tractor 1))))


    doesn't. Any chance for that? It appears that functions didn't lost lot of speed...



    http://david.farmnet.com.au/files/2009/02/tractor_stilts.jpg">
    #54
    Whither newLISP? / Few questions ...
    October 11, 2009, 02:10:32 AM
    I'm trying to write an article on Newlisp macros (mostly stuff I already discussed) and I need few bits of information:



    Lutz: did you reinvented macros in the form of fexprs through your own experiments, or you analysed the past and concluded that you liked MacLisp and Interlisp "special forms" more than CL or Scheme.  When it happened (year?)



    Everyone: theoretically, dynamic scope causes funarg problems, discussed on this forum (itistoday, Jeff recently) and on my blog. (Briefly, if your program uses variable x, and it calls the function or macro that uses local variable x, both variables of the same name are accessible, and if one is not careful, called function can confuse the two. One of the main purpose of the contexts is to solve the problem if it occured.)



    Did you have such problem in practice? How serious it was? Did it happened that contexts were not enough for your problem? [I can answer this on myself- I cannot recall I ever came into such problem in practice]



    Please, answer on this questions, because if you do not comment, I can assume that you had no problems, but I cannot prove it.
    #55
    It appears to be error:


    • (
    println (difference '(nil a) '(true nil)))     ;=>(a)

    (println (difference '(nil a) (list true nil))) ;=>(nil a)[/list]
    #56
    newLISP in the real world / Replace Surprise
    September 13, 2009, 01:03:48 PM
    I just discovered this unusual behaviour:


    (dolist (i '("first" "second" "third"))
      (println (replace "x" "hej, x" i)))

    hej, first
    hej, first
    hej, first
    "hej, first"


    Is it bug or feature?



    (If "hej, x" is replaced with (copy "hej, x") then everything works as expected. )
    #57
    newLISP in the real world / Why ? and @ are in (symbols)?
    September 13, 2009, 12:08:04 PM
    > (symbols)
    (! != $ ... $main-args  % & * + - / : < << <= = > >= >> ? @ Class MAIN NaN? Tree ^ abort abs ...
    #58
    http://services.videotechnology.com/resume/Ted_Walther.jpg">

    Ted



    http://instprog.com/Cyril.jpg">

    Cyril





    http://instprog.com/KM2small.jpg">

    Kazimir
    #59
    (exists nil? '(1 2 nil 3)) => nil

    (exists nil? '(1 2 3)) => nil




    i.e. exists doesn't return sensible result for predicate nil?. I could replace this particular (exists nil? ...) with (find nil ...) but exists also doesn't work for all other predicates satisfied by nil, because returned nil cannot be interpreted. Unfortunately, there are numerous such cases, and some are important.



    (exists logical-constant? '(x y z nil true)) => nil




    I think that exists should return only true and false (nil), just like its dual for-all. Other part of the functionality, find-the-first-satisfying can be defined independently. (Overloading existing find causes the problems similar to existing ones.) Alternatively, index of the first element satisfying predicate, or even pair (index value) could be returned from exists - instead of value. I guess that one function - one functionality approach has the least chance to cause problems.
    #60
    newLISP newS / (and), (or), (+), (*) ...
    June 11, 2009, 05:26:51 AM
    In Newlisp


    > (and)
    nil
    > (or)
    nil
    > (+)

    ERR: missing argument in function +
    > (*)

    ERR: missing argument in function *
    >


    In Common Lisp:


    [1]> (or)
    NIL
    [2]> (and)
    T
    [3]> (+)
    0
    [4]> (*)
    1


    IN Scheme:


    > (or)
    #f
    > (and)
    #t
    > (+)
    0
    > (*)
    1
    >


    Can I suggest change of the behaviour in Newlisp, this time I think CL and Scheme got it right, ie. result of the operation on zero arguments is neutral element for given operation. It is the most critical for and, because unilke + and *, it returns some result, but not expected one. One example from practice:



    (and x1 x2 true x3 ...) = (and x1 x2 x3 ...)



    Simplification of and - formula by deletion of true is typical syntactical transformation of logical formula. However, in Newlisp, the last deletition cannot be done because



    (and true) =/= (and)



    other interesting cases are max and min, even begin can be understood as special case.