Information Processing Language: Difference between revisions

Revision as of 02:52, 15 June 2020

Latest revision as of 09:16, 20 July 2025

(26 intermediate revisions by 18 users not shown)

Line 1:

{{Short description|Early programming language for lists}}

{{More citations needed|date=January 2022}}

{{Infobox programming language

| name = Information Processing Language (IPL)

Line 6 ⟶ 8:

| designer =[[Allen Newell]], [[Cliff Shaw]], [[Herbert A. Simon]]

| developer =Allen Newell, Cliff Shaw, Herbert A. Simon

| latest_release_version =IPL-VIV

| latest release date = <!-- {{start date and age|1959?|MM|DD|df=yes}} -->

| typing =

Line 20 ⟶ 22:

'''Information Processing Language''' ('''IPL''') is a [[programming language]] created by [[Allen Newell]], [[Cliff Shaw]], and [[Herbert A. Simon]] at [[RAND Corporation]] and the [[Carnegie Institute of Technology]] about 1956. Newell had the job of language specifier-application programmer, Shaw was the system programmer, and Simon had the job of application programmer-user.

TheIPL code includesincluded features intended to helpfacilitate withAI programsprogramming, that perform simplespecifically [[Problem_solving|problem solving actions]]. such as lists, [[dynamic memory allocation]], [[data type]]s, [[Recursion (computer science)|recursion]], [[Subroutine|functions]] as arguments, generators, and [[cooperative multitasking]]. IPL inventedalso introduced the conceptconcepts of [[Symbolic_language_(programming)|symbol processing]] and list processing. Unfortunately, albeitall of these innovations were cast in ana difficult [[Assembly language|assembly-language]] style. Nontheless, IPL-V (the only public version of IPL) ran on many computers through the mid 1960s.

==Basics of IPL==

An IPL computer has:

# A set of ''symbols''. All symbols are addresses, and name cells. Unlike symbols in later languages, symbols consist of a character followed by a number, and are written H1, A29, 9–7, 9–100.

An IPL computer has:

# A set of ''symbols''. All symbols are addresses, and name cells. Unlike symbols in later languages, symbols consist of a character followed by a number, and are written H1, A29, 9-7, 9-100.

## Cell names beginning with a letter are ''regional'', and are absolute addresses.

## Cell names beginning with "9-" are ''local'', and are meaningful within the context of a single list. One list's 9-1 is independent of another list's 9-19–1.

## Other symbols (e.g., pure numbers) are ''internal''.

# A set of ''cells''. Lists are made from several cells including mutual references. Cells have several fields:

Line 36 ⟶ 37:

# A set of ''primitive processes'', which would be termed ''primitive functions'' in modern languages.

The data structure of IPL is the list, but lists are more intricate structures than in many languages. A list consists of a singly linked sequence of symbols, as might be expected -- plusexpected—plus some ''description lists'', which are subsidiary singly linked lists interpreted as alternating attribute names and values. IPL provides primitives to access and mutate attribute value by name. The description lists are given local names (of the form 9-19–1). So, a list named L1 containing the symbols S4 and S5, and described by associating value V1 to attribute A1 and V2 to A2, would be stored as follows. 0 indicates the end of a list; the cell names 100, 101, etc. are automatically generated internal symbols whose values are irrelevant. These cells can be scattered throughout memory; only L1, which uses a regional name that must be globally known, needs to reside in a specific place.

{|style="font-family:monospace; margin: 1em auto" class="wikitable"

|+ '''IPL-V List Structure Example'''

|-

!Name !! SYMB !! LINK

Line 66 ⟶ 67:

There are eight instructions, based on the values of P: subroutine call, push/pop S to H0; push/pop the symbol in S to the list attached to S; copy value to S; conditional branch. In these instructions, S is the target. S is either the value of the SYMB field if Q=0, the symbol in the cell named by SYMB if Q=1, or the symbol in the cell named by the symbol in the cell named by SYMB if Q=2. In all cases but conditional branch, the LINK field of the cell tells which instruction to execute next.

IPL has a library of some 150 basic operations. These include such operations as:

* Test symbols for equality

* Find, set, or erase an attribute of a list

* locateLocate the next symbol in a list; insert a symbol in a list; erase or copy an entire list.

* Arithmetic operations (on symbol names).

* Manipulation of symbols; e.g., test if a symbol denotes an integer, or make a symbol local.

* I/O operations

* "generatorsGenerators", which correspond to iterators and filters in functional programming. For example, a generator may accept a list of numbers and produce the list of their squares. Generators could accept suitably designed functions—- strictlyfunctions—strictly, the addresses of code of suitably designed functions—- asfunctions—as arguments.

== History ==

IPL was first utilized to demonstrate that the theorems in ''[[Principia Mathematica]]'' which were proven laboriously by hand, by [[Bertrand Russell]] and [[Alfred North Whitehead]], could in fact be [[automated theorem proving|proven by computation]]. According to Simon's autobiography ''Models of My Life'', this application was originally developed first by hand simulation, using his children as the computing elements, while writing on and holding up note cards as the registers which contained the state variables of the program.

IPL was used to implement several early [[artificial intelligence]] programs, also by the same authors: the [[Logic Theorist]] (1956), the [[General Problem Solver]] (1957), and their [[computer chess]] program [[NSS (chess program)|NSS]] (1958).

Several versions of IPL were created: IPL-I (never implemented), IPL-II (1957 for [[JOHNNIAC]]), IPL-III (existed briefly), IPL-IV, IPL-V (1958, for [[IBM 650]], [[IBM 704]], [[IBM 7090]], [[Philco model 212]], many others. Widely used),. IPL-VI was a proposal for an IPL hardware.<ref>{{FOLDOC|Information+Processing+Language}}</ref>{{sfn|Shaw|Newell|Simon|Ellis|1958}}{{sfn|Sammet|1969|p=389}}

A co-processor “IPL-VC” for the CDC 3600 at Argonne National Libraries was developed which could run IPL-V commands.{{sfn|Hodges|1964}}{{sfn|Sammet|1969|p=393–394}} It was used to implement another checker-playing program.{{sfn|Cowell|Reed|1965}} This hardware implementation did not improve running times sufficiently to “compete favorably with a language more directly oriented to the structure of present-day machines”.{{sfn|Carson|Robinson|1966|p=5}}

However the language was soon displaced by [[Lisp programming language|Lisp]], which had much more powerful features, a simpler syntax, and the benefit of automatic [[garbage collection (computer science)|garbage collection]].

IPL was soon displaced by [[Lisp (programming language)|Lisp]], which had much more powerful features, a simpler syntax, and the benefit of automatic [[garbage collection (computer science)|garbage collection]].

== Legacy to computer programming ==

==Legacy to computer programming==

IPL arguably introduced several programming language features:

* ''List manipulation''—but only lists of atoms, not general lists.

* ''Property lists''—but only when attached to other lists.

* ''Higher-order functions''—except that—while assembly programming hashad always beenallowed ablecomputing towith compute withthe addresses of functions to call;, IPL was an early attempt to generalize this property of assembly language and in a principled way

* ''Computation with symbols''—except—though thatsymbols thehave symbolsa arerestricted form in IPL (letter+number, notfollowed fullby words.number)

* ''Virtual machine''.

Many of these features were generalized, rationalized, and incorporated into Lisp<ref>[http://www-formal.stanford.edu/jmc/history/lisp/node2.html John McCarthy (1979) ''History of Lisp'' "LISP prehistory - Summer 1956 through Summer 1958."]</ref> and from there into many other programming languages during the next several decades.

Line 99 ⟶ 102:

==Sources==

* {{FOLDOC}}

* {{cite report

|author1-first=Daniel F.

|author1-last=Carson

|author2-first=George A.

|author2-last=Robinson

|date=May 1966

|title=Gyro II, A Macro-Defined System for List Processing

|id=ANL-7149

|publisher=Applied Mathematics Division, Argonne National Laboratories}}

* {{cite report

|author1-first=W. R.

|author1-last=Cowell

|author2-first=M. C.

|author2-last=Reed

|date=October 1965

|title=A Checker-Playing Program for the IPL-VC Computer

|id=ANL-7109

|publisher=Applied Mathematics Division, Argonne National Laboratories}}

* {{cite report

|author-first=Donald

|author-last=Hodges

|date=May 1964

|title=IPL-VC: A Computer System having the IPL-V Instruction Set

|id=ANL-6888

|publisher=Applied Mathematics Division, Argonne National Laboratories}}

* {{cite book

|author-last=Sammet

|author-first=Jean E.

|title=Programming languages: history and fundamentals

|publisher=Prentice Hall

|___location=Englewood Cliffs, N.J.

|year=1969

|pages=388{{en dash}}400}}

* {{cite conference

|author1-last=Shaw

|author1-first=J. C.

|author2-last=Newell

|author2-first=A.

|author3-last=Simon

|author3-first=H. A.

|author4-last=Ellis

|author4-first=T. O.

|title=A Command Structure for Complex Information Processing

|date=1958

|publisher=Association for Computing Machinery

|isbn=9781450378642

|doi=10.1145/1457769.1457803

|book-title=Proceedings of the May 6–8, 1958, Western Joint Computer Conference: Contrasts in Computers

|series=IRE-ACM-AIEE '58 (Western)

|pages=119{{endash}}128}}

==Further reading==

*Newell, A. and F.C. Shaw. "Programming the Logic Theory Machine." Feb. 1957. Proceedings of the Western Joint Computer Conference, pp. 230-240.

* {{cite conference

*Newell, Allen, and Fred M. Tonge. 1960. "An Introduction to Information Processing Language V." CACM 3(4): 205-211.

|author-last1=Newell

*Newell, Allen. 1964. ''Information Processing Language-V Manual; Second Edition''. Rand Corporation [Allen Newell], Englewood Cliffs, NJ: Prentice-Hall.

|author-first1=Allen

*Samuel, Arthur L.: Programming Computers to Play Games. In: Advances in Computers, Vol. 1, 1960, pp 165-192 (esp.: 171-175).

|author-last2=Shaw

|author-first2=J. C.

|title=Programming the Logic Theory Machine

|year=1957

|publisher=Association for Computing Machinery

|isbn=9781450378611

|book-title=Papers Presented at the February 26–28, 1957, Western Joint Computer Conference: Techniques for Reliability

|pages=230–240

|conference=IRE-AIEE-ACM '57 (Western)

|doi=10.1145/1455567.1455606|doi-access=free

}}

* {{cite journal

|author-last1=Newell

|author-first1=Allen

|author-last2=Tonge

|author-first2=Fred M.

|title=An Introduction to Information Processing Language V

|year=1960

|publisher=Association for Computing Machinery

|___location=New York, NY, USA

|volume=3

|number=4

|issn=0001-0782

|doi=10.1145/367177.367205

|journal=Communications of the ACM

|pages=205–211|s2cid=16609075

|doi-access=free

}}

* {{cite book

|author-last1=Newell

|author-first1=Allen

|author-last2=Tonge

|author-first2=Fred M.

|author-last3=Feigenbaum

|author-first3=Edward A.

|author-last4=Green Jr.

|author-first4=Bert F.

|author-last5=Mealy

|author-first5=George H.

|display-authors=2

|title=Information Processing Language-V Manual

|publisher=Prentice Hall

|___location=Englewood Cliffs, N.J.

|year=1964}}

* {{cite book

|author-last=Samuel

|author-first=Arthur L.

|title=Advances in Computers Volume 1

|chapter=Programming Computers to Play Games

|volume=1

|editor-last=Alt

|editor-first=Franz L.

|publisher=Elsevier

|pages=165–192

|year=1960

|issn=0065-2458

|doi=10.1016/S0065-2458(08)60608-7|isbn=9780120121014

}}

==External links==

Line 111 ⟶ 229:

* [http://bitsavers.org/pdf/rand/ipl/ IPL documents from BitSavers]

* [http://www-formal.stanford.edu/jmc/history/lisp/node2.html Influence of IPL on LISP]

* [https://github.com/jeffshrager/IPL-V A Common LISP interpreter for IPL-V, including a working transcription of the Logic Theory Machine (actively under development in 2025)]

{{Authority control}}

[[Category:Procedural programming languages]]