Maclisp

From Wikipedia, the free encyclopedia

MACLISP (or Maclisp) is a dialect of the Lisp programming language. It originated at MIT's Project MAC (from which it derived its prefix) in the late 1960s and was based on Lisp 1.5. Richard Greenblatt was the main developer of the original codebase for the PDP-6; Jonl White was responsible for its later maintenance and development. The name 'Maclisp' started being used in the early 1970s to distinguish it from other forks of PDP-6 Lisp, notably BBN Lisp.

Maclisp ran on DEC PDP-6/10 computers, initially only on ITS, but later under all the other PDP-10 operating systems. Its original implementation was in PDP-10 assembly language. It was later implemented on Multics using PL/I. Maclisp developed considerably in its lifetime, adding major features along the way which in other language systems would typically correspond to major release numbers.

Maclisp was used to implement the Macsyma symbolic algebra program; Macsyma's development also drove a number of features in Maclisp. The SHRDLU blocks-world program was written in Maclisp, and so the language was in widespread use in the artificial intelligence research community through the early 1980s. It was also used to implement other programming languages, such as Planner and Scheme. Multics Maclisp was used to implement the first Lisp-based Emacs.

Maclisp was very influential, but is no longer actively maintained. Nonetheless, it now runs on PDP-10 emulators and can be used for experimenting with early AI programs.

Maclisp started with a small, fixed number of data types: cons cell, atom (later called "symbol"), integer, and floating-point number. Later additions included: arrays, which were however never first-class data-types; arbitrary-precision integers (bignums); strings; and tuples. All objects (except inums) were implemented as pointers, and their data type was determined by the block of memory into which it pointed, with a special case for small numbers (inums).

Programs could be interpreted or compiled. Compiled behavior was the same as interpreted except that local variables were lexical by default in compiled code, and no error checking was done for inline operations such as CAR and CDR. The Ncomplr compiler (mid-1970s) introduced fast numeric support to the Lisp world, generating machine instructions for arithmetic rather than calling interpretive routines which dispatched on data type. This made Lisp arithmetic comparable in speed to Fortran for scalar operations (though Fortran array and loop implementation remained much better).

The original version was limited by the 18-bit word address of the PDP-10, and considerable effort was expended in keeping the implementation lean and simple. Multics Maclisp had a far larger address space, but was expensive to use. When the memory and processing power of the PDP-10 were exceeded, the Lisp Machine was invented: Lisp Machine Lisp is the direct descendant of Maclisp. Several other Lisp dialects were also in use, and the need to unify the community resulted in the modern Common Lisp language.

MACLISP was named for Project MAC, and is unrelated to Apple's Macintosh ("Mac") computer, which it predated by many years. The Lisp systems for the Macintosh, MCL and OpenMCL, have no particular similarity to Maclisp.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.