<mnemonix> don't forget the lambdas
<mnemonix> they are your best friend <3
<Delilah> lambdas. yeah.
<Delilah> define something, lambda xy..
Mon Jan 24 2005
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - -
general
-
Programmer's
Lair [Artificial Intelligence - Communications - DirectX -
Game Source - Graphics - Sound - Book Store] [English]
- The
World Wide Web Virtual Library: Logic Programming]
[English]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - -
HASKELL
Haskell
is a general purpose, purely functional programming language.
Haskell compilers are freely available for almost any computer.
[http://www.haskell.org]
Please
refer to the links
//
no notes are available at this moment
-
www.haskell.org
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - -
LISP
LISP
n.
[from
`LISt Processing language', but mythically from `Lots of Irritating
Superfluous Parentheses'] AI's mother tongue, a language based
on the ideas of (a) variable-length lists and trees as fundamental
data types, and (b) the interpretation of code as data and
vice-versa. Invented by John McCarthy at MIT in the late 1950s,
it is actually older than any other HLL still in use except
FORTRAN. Accordingly, it has undergone considerable adaptive
radiation over the years; modern variants are quite different
in detail from the original LISP 1.5. The dominant HLL among
hackers until the early 1980s, LISP now shares the throne
with C. Its partisans claim it is the only language that is
truly beautiful. See languages of choice.
All
LISP functions and programs are expressions that return values;
this, together with the high memory utilization of LISPs,
gave rise to Alan Perlis's famous quip (itself a take on an
Oscar Wilde quote) that "LISP programmers know the value
of everything and the cost of nothing".
One
significant application for LISP has been as a proof by example
that most newer languages, such as COBOL and Ada, are full
of unnecessary crocks. When the Right Thing has already been
done once, there is no justification for bogosity in newer
languages.
The Jargon File, 4.1.4
Please
refer to the links
//
no notes are available at this moment
-
www.lisp.org
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - -
PROLOG
Prolog
<programming>
Programming in Logic or (French) Programmation
en Logique. The first of the huge family of logic
programming languages.
Prolog
was invented by Alain Colmerauer and Phillipe Roussel
at the University of Aix-Marseille in 1971. It was first
implemented 1972 in ALGOL-W. It was designed originally
for
natural-language processing but has become one of the most
widely used languages for artificial intelligence.
It
is based on LUSH (or SLD) resolution theorem
proving and unification. The first versions had no
user-defined functions and no control structure other than
the
built-in depth-first search with backtracking. Early
collaboration between Marseille and Robert Kowalski at
University of Edinburgh continued until about 1975.
Early
implementations included C-Prolog, ESLPDPRO,
Frolic, LM-Prolog, Open Prolog, SB-Prolog, UPMAIL
Tricia Prolog. In 1998, the most common Prologs in use are
Quintus Prolog, SICSTUS Prolog, LPA Prolog, SWI
Prolog, AMZI Prolog, SNI Prolog.
ISO
draft standard at Darmstadt, Germany
(ftp://ftp.th-darmstadt.de/pub/programming/languages/prolog/standard/).
or UGA, USA (ftp://ai.uga.edu/ai.prolog.standard).
See
also negation by failure, Kamin's interpreters,
Paradigms of AI Programming, Aditi.
A
Prolog interpreter in Scheme.
(ftp://cpsc.ucalgary.ca/pub/prolog1.1).
A
Prolog package
(ftp://cpsc.ucalgary.ca/pub/prolog1.1/prolog11.tar.Z) from
the University of Calgary features delayed goals and
interval arithmetic. It requires Scheme with
continuations.
["Programming
in Prolog", W.F. Clocksin & C.S. Mellish,
Springer, 1985].
-
Prolog
Tutorial [English]
-
Prolog
Resource Guide [English]
-
The
World Wide Web Virtual Library: Logic Programming]
[English]
//
no notes are available at this moment
-
www.visual-prolog.com
[English]
- SWI-Prolog
-- an LGPL comprehensive portable Prolog compiler. [English]
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - -
SCHEME
Scheme
is a statically scoped and properly tail-recursive dialect
of the Lisp programming language invented by Guy Lewis Steele
Jr. and Gerald Jay Sussman. It was designed to have an exceptionally
clear and simple semantics and few different ways to form
expressions. A wide variety of programming paradigms, including
imperative, functional, and message passing styles, find convenient
expression in Scheme.
Scheme
was one of the first programming languages to incorporate
first class procedures as in the lambda calculus, thereby
proving the usefulness of static scope rules and block structure
in a dynamically typed language. Scheme was the first major
dialect of Lisp to distinguish procedures from lambda expressions
and symbols, to use a single lexical environment for all variables,
and to evaluate the operator position of a procedure call
in the same way as an operand position. By relying entirely
on procedure calls to express iteration, Scheme emphasized
the fact that tail-recursive procedure calls are essentially
goto's that pass arguments. Scheme was the first widely used
programming language to embrace first class escape procedures,
from which all previously known sequential control structures
can be synthesized. More recently, building upon the design
of generic arithmetic in Common Lisp, Scheme introduced the
concept of exact and inexact numbers. Scheme is also the first
programming language to support hygienic macros, which permit
the syntax of a block-structured language to be extended reliably.
[www.swiss.ai.mit.edu/projects/scheme/]
-
Scheme
tutorials [English]
-
Scheme
Research Library [English]
//
no notes are available at this moment
-
www.schemers.org
[English]
- www.drscheme.org
[English]
|