Re: Develop Lisp applications using the Cusp Eclipse plug-in



Steve Graham wrote:
Develop Lisp applications using the Cusp Eclipse plug-in

http://tinyurl.com/2l8l8d

"Notice that the phrase "first functional language" here is apt, as everything is based on functions (sic). Each function can have a variable number of parameters (sic). The processing of these lists using recursion and Lisp functions like car and cdr is the power of list processing using Lisp (sic)."


One step forward, three steps back. Sick.

kzo

--
http://www.theoryyalgebra.com/

"Career highlights? I had two. I got an intentional walk
from Sandy Koufax and I got out of a rundown against the Mets."."
- Bob Uecker
.

Relevant Pages

  • Re: The empty list and the end of a list
    ... I don' t know exactly what you mean by "tail ... Maybe it is a synonym for "tail recursion", ... some recursive algorithm just aren't tail recursions. ... recursive lists). ...
    (comp.lang.lisp)
  • Re: Interesting article by Joel Spolsky: The Perils of JavaSchools
    ... >>>Lists are recursively defined structures. ... >> definition to define a list, but it isn't obligatory. ... (Pedant's observation - recursion cannot be ... Richard Harter, cri@xxxxxxxx ...
    (comp.programming)
  • Re: Lisp Question
    ... I think they use us a lot to teach recursion, ... seeing weirdly named operators and we have no abstraction capability. ... So lists are mostly what they teach, and then not well, and people come away ... I doubt many in school are teaching DEFCLASS or DEFMETHOD in classes, ...
    (comp.lang.lisp)
  • Re: set picking
    ... so i can check the answers i get with math by getting scheme to help. ... i think it's the same concept, but you got all of the recursion stuff ... The unordered subsets reduces to the known combinations problem. ... lists:. ...
    (comp.lang.scheme)
  • Re: advice from a newbie
    ... find recursion a barrier, it seemed to me to be a natural way of expressing solutions to problems. ... "To append two lists, if the first is empty the result is the same as the ... the first, all those greater than the first, sort each list, append ...
    (comp.lang.prolog)