-
-
Notifications
You must be signed in to change notification settings - Fork 85
/
laning-and-zierler-system.scroll
28 lines (23 loc) · 1.17 KB
/
laning-and-zierler-system.scroll
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
import ../code/conceptPage.scroll
id laning-and-zierler-system
name Laning and Zierler system
appeared 1953
tags pl
centralPackageRepositoryCount 0
country United States
originCommunity Massachusetts Institute of Technology
wikipedia https://en.wikipedia.org/wiki/Laning_and_Zierler_system
example
1 x = 0,
z = 1 - x2/2 + x4/2·3·4 - x6/2·3·4·5·6
+ x8/2·3·4·5·6·7·8 - x10/2·3·4·5·6·7·8·9·10,
related speedcoding punched-tape
summary The Laning and Zierler system (sometimes called "George" by its users) was one of the first operating algebraic compilers, that is, a system capable of accepting mathematical formulae in algebraic notation and producing equivalent machine code (the term compiler had not yet been invented and the system was referred to as "an interpretive program"). It was implemented in 1952 for the MIT WHIRLWIND by J. Halcombe Laning and Neal Zierler. It is preceded by the UNIVAC A-2, IBM Speedcoding and a number of systems that were proposed but never implemented.
created 2005
backlinksCount 11
pageId 2732031
revisionCount 41
dailyPageViews 6
appeared 1952
hopl https://hopl.info/showlanguage.prx?exp=6
semanticScholar 0