enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Lisp (programming language) - Wikipedia

    en.wikipedia.org/wiki/Lisp_(programming_language)

    Both Common Lisp and Scheme have operators for non-local control flow. The differences in these operators are some of the deepest differences between the two dialects. Scheme supports re-entrant continuations using the call/cc procedure, which allows a program to save (and later restore) a particular place in execution. Common Lisp does not ...

  3. Comparison of programming languages - Wikipedia

    en.wikipedia.org/wiki/Comparison_of_programming...

    Objective-C: Application, general Yes Yes No Yes No Yes Concurrent No OCaml: Application, general Yes Yes Yes Yes Yes No No Occam: General Yes No No Yes No No Concurrent, process-oriented: No Opa: Web applications Yes No Yes No Yes No Distributed No OpenLisp: General, Embedded Lisp Engine Yes Yes Yes No Yes No Optionally ISLISP: Oxygene ...

  4. List of Lisp-family programming languages - Wikipedia

    en.wikipedia.org/wiki/List_of_Lisp-family...

    Mostly based on Scheme and Common Lisp, was designed as system and application programming language by Apple; first used to write an operating system and applications for internal prototypes of the later released Apple Newton computer; first official version of Apple Dylan also had s-expression based syntax; Apple collaborated with partners to ...

  5. Scheme (programming language) - Wikipedia

    en.wikipedia.org/wiki/Scheme_(programming_language)

    Scheme is primarily a functional programming language. It shares many characteristics with other members of the Lisp programming language family. Scheme's very simple syntax is based on s-expressions, parenthesized lists in which a prefix operator is followed by its arguments. Scheme programs thus consist of sequences of nested lists.

  6. Linked list - Wikipedia

    en.wikipedia.org/wiki/Linked_list

    Many programming languages such as Lisp and Scheme have singly linked lists built in. In many functional languages , these lists are constructed from nodes, each called a cons or cons cell . The cons has two fields: the car , a reference to the data for that node, and the cdr , a reference to the next node.

  7. Apply - Wikipedia

    en.wikipedia.org/wiki/Apply

    In mathematics and computer science, apply is a function that applies a function to arguments. It is central to programming languages derived from lambda calculus, such as LISP and Scheme, and also in functional languages.

  8. Gambit (Scheme implementation) - Wikipedia

    en.wikipedia.org/wiki/Gambit_(Scheme_implementation)

    Gambit, also called Gambit-C, is a programming language, a variant of the language family Lisp, and its variants named Scheme. The Gambit implementation consists of a Scheme interpreter , and a compiler which compiles Scheme into the language C , which makes it cross-platform software .

  9. Common Lisp - Wikipedia

    en.wikipedia.org/wiki/Common_Lisp

    Common Lisp is sometimes termed a Lisp-2 and Scheme a Lisp-1, referring to CL's use of separate namespaces for functions and variables. (In fact, CL has many namespaces, such as those for go tags, block names, and loop keywords). There is a long-standing controversy between CL and Scheme advocates over the tradeoffs involved in multiple namespaces.