name=FLooP
nameURL=
see=
logo=
type=S%20-%20block-structured
desc=FLooP%20was%20a%20very%20simple%20recursive%0D%0Ablock%20structured%20language%20invented%20by%0D%0ADouglas%20Hofstadter%20for%20his%20book%20%0D%0A%3Ci%3EGodel%2C%20Escher%2C%20Bach%3C%2Fi%3E.%20%20It%20features%0D%0Asimple%20subroutine%20structure%2C%20very%20simple%0D%0Anumber%20and%20boolean%20handling%2C%20and%20recursion.%0D%0AUnlike%20its%20cousin%20BLooP%2C%20FLooP%20does%20support%0D%0Aunbounded%20loops.%20%20This%20allows%20it%20to%20%0D%0Apossess%20the%20full%20power%20of%20a%20Turing%20machine%2C%0D%0Athus%20making%20it%20fair%20game%20for%20various%0D%0Aundecidability%20theorums.%0D%0AThe%20syntax%20of%20FLooP%20is%20rather%20verbose%2C%0D%0Abut%20simple%20in%20structure.
origin=Hofstader%2C%201979%20%20%28implementation%3A%20Cowan%2C%201994%29
seealso=BLooP
remark=Though%20Hofstadter%20doesn%27t%20mention%20it%0D%0Ain%20%3Ci%3EGEB%3C%2FI%3E%2C%20FLooP%20is%20similar%20to%20%0D%0Aearly%20exercises%20in%20exploring%20the%20%0D%0Acomputational%20model%20of%20%22Random%20Access%0D%0AMachines%22.%20%20Note%20the%20use%20of%20%27CELL%280%29%20%3C%3D%202%27%0D%0Aand%20similar%20constructs.%0D%0A%3CBR%3E%0D%0AThough%20FLooP%20was%20never%20intended%20to%20be%0D%0Amore%20than%20an%20academic%20exercise%2C%20an%20%0D%0Aimplementation%20of%20FLooP%20in%20Perl%20was%0D%0Amade.%20%20Unfortunately%2C%20I%20can%27t%20seem%20to%0D%0Afind%20it.%0D%0A
links1=http%3A%2F%2Fwww.geocities.com%2FResearchTriangle%2F6100%2Fgeb.html
links2=BLoop%2FFLoop%20Implementation%20Download%3Dhttp%3A%2F%2Fwww.tuxedo.org%2F%7Eesr%2Fretro%2F
links3=
links4=
links5=
date=Last%20updated%2012%2F6%2F00
sample=%3Cpre%3E%3Cfont%20size%3D%22-1%22%3E%0D%0ADEFINE%20PROCEDURE%20%27%27DIVIDE%27%27%20%5BDIVIDEND%2C%20DIVISOR%5D%3A%0D%0A%20%20BLOCK%200%3A%20BEGIN%0D%0A%20%20%20%20IF%20DIVISOR%20%3C%201%2C%20THEN%3A%20QUIT%20BLOCK%200%3B%0D%0A%20%20%20%20CELL%280%29%20%3C%3D%20DIVIDEND%3B%0D%0A%20%20%20%20LOOP%20AT%20MOST%20DIVIDEND%20TIMES%3A%0D%0A%20%20%20%20%20%20BLOCK%201%3A%20BEGIN%0D%0A%20%20%20%20%20%20%20%20IF%20CELL%280%29%20%3C%20DIVISOR%2C%20THEN%3A%20QUIT%20BLOCK%200%3B%0D%0A%20%20%20%20%20%20%20%20CELL%280%29%20%3C%3D%20MINUS%5BCELL%280%29%2C%20DIVISOR%5D%3B%0D%0A%20%20%20%20%20%20%20%20OUTPUT%20%3C%3D%20OUTPUT%20%2B%201%3B%0D%0A%20%20%20%20%20%20BLOCK%201%3A%20END%3B%0D%0A%20%20BLOCK0%3A%20END.%0D%0A%0D%0ADEFINE%20PROCEDURE%20%27%27PERFECT%3F%27%27%20%5BN%5D%3A%0D%0ABLOCK%200%3A%20BEGIN%0D%0A%20%20CELL%280%29%20%3C%3D%200%3B%0D%0A%20%20CELL%281%29%20%3C%3D%200%3B%0D%0A%20%20LOOP%20DIVIDE%20%5BN%2C2%5D%20TIMES%3A%0D%0A%20%20BLOCK%201%20BEGIN%3A%0D%0A%20%20%20%20CELL%281%29%20%3C%3D%20CELL%281%29%20%2B%201%3B%0D%0A%20%20%20%20IF%20REMAINDER%5BN%2CCELL%281%29%5D%20%3D%200%2C%20THEN%3A%20CELL%20%3C%3D%20CELL%280%29%20%2B%20CELL%281%29%3B%0D%0A%20%20BLOCK%201%20END%3B%0D%0A%20%20IF%20CELL%280%29%20%3D%20N%20THEN%3A%20OUTPUT%20%3C%3D%20YES%3B%0D%0ABLOCK%200%3A%20END.%0D%0A%3C%2Ffont%3E%3C%2Fpre%3E
_store=1
_add=BLooP
_usertab=1
_usersearch=0
_format=full
=
name=FORMAC
nameURL=
see=FORTRAN
logo=
type=M%20-%20Mathematical%20or%20Simulation
desc=FORMAC%20is%20a%20dialect%20of%20FORTRAN%20with%20an%0D%0Aextensive%20set%20of%20extensions%20for%20symbolic%0D%0Acomputation%20and%20expression%20manipulation.%0D%0AIt%20was%20designed%20and%20implemented%20in%20the%20%0D%0A1960s%20to%20support%20scientific%20and%0D%0Aengineering%20computing%20on%0D%0AIBM%20mainframes.%0D%0A%3Cbr%3E%0D%0AAs%20a%20kind%20of%20symbolic%20dialect%20of%20FORTRAN%20IV%2C%0D%0Athe%20original%20FORMAC%20had%20syntax%20and%20overall%0D%0Aprogram%20structure%20similar%20to%20FORTRAN.%20%20%0D%0AData%20types%20supported%20included%20all%20the%0D%0AFORTRAN%20numeric%20types%2C%20plus%20rational%0D%0Anumbers%2C%20symbols%2C%0D%0Aarrays%2C%20and%20expressions.%0D%0AFORMAC%20programs%20could%20include%20subroutines%0D%0Aand%20functions%2C%20and%20could%20use%20other%20FORTRAN%0D%0Afacilities%20like%20common%20areas.%0D%0A%3Cbr%3E%0D%0AFORMAC%20was%20originally%20implemented%20as%20a%20%0D%0Apreprocessor%20on%20top%20of%20FORTRAN%3B%20the%0D%0Aformulae%20and%20symbolic%20function%20calls%0D%0Awere%20transformed%20into%20calls%20to%20a%0D%0Asymbolic%20manipulation%20library.%0D%0AFor%20I%2FO%2C%20FORMAC%20could%20take%20advantage%20of%0D%0Aall%20the%20usual%20FORTRAN%20facilities%2C%20and%20%0D%0Acould%20also%20print%20its%20symbolic%20expressions.%0D%0A%3Cbr%3E%0D%0AIn%20the%20late%201960s%2C%20%0D%0AIBM%20researchers%20created%20a%20similar%20%0D%0Aproprocessor%20for%20PL%2FI%2C%20%0D%0Aimaginatively%20named%20PL%2FI-FORMAC.%0D%0A%3Cbr%3E%0D%0AUnlike%20later%20symbolic%20math%20systems%2C%20FORMAC%0D%0Asupported%20creation%20of%20expressions%20but%20not%0D%0Ameta-expressions%20%28rules%29.%20%20This%20is%0D%0Aindicative%20of%20its%20early%20status%20in%20the%0D%0Aevolution%20of%20symbolic%20computation%2C%20and%0D%0Adespite%20its%20comparative%20lack%20of%20features%0D%0Ait%20was%20influential%20on%20the%20field%20on%20its%0D%0Aimmediate%20successors%20%28e.g.%20Reduce%2C%20Macsyma%29.%0D%0AFORMAC%20was%20used%20up%20until%20the%20early%201990s.%0D%0A
origin=Jean%20Sammet%20%3Ci%3Eet%20al%3C%2Fi%3E%2C%20%20IBM%2C%201964.
seealso=Mathematica%2C%20Macyma%2C%20APL%2C%20PL%2FI.
remark=FORMAC%20was%20the%20first%20general%0D%0Asymbolic%20mathematics%0D%0A%3Ci%3E%3Cb%3Elanguage%3C%2Fb%3E%3C%2Fi%3E.%20%20There%20had%0D%0Abeen%20other%20attempts%20to%20apply%20computers%20to%0D%0Asymbol%20manipulation%2C%20but%20prior%20to%20FORMAC%0D%0Aall%20of%20them%20were%20libraries%20of%20procedures%0D%0Aand%20functions%20that%20had%20to%20be%20assembled%20%0D%0Ain%20the%20context%20of%20a%20conventional%20language.%0D%0A%3Cbr%3E%0D%0AEven%20after%20FORMAC%20and%20its%20cousin%20PL%2FI-FORMAC%0D%0Awere%20dropped%20as%20official%20IBM%20products%2C%20%0D%0Athey%20continued%20to%20be%20enhanced%20and%20used%20by%0D%0Amembers%20of%20IBM%27s%20SHARE%20user%20group.%0D%0A%3Cbr%3E%0D%0AThe%20name%20stands%20for%20FORmula%20MAnipulation%0D%0ACompiler.
links1=
links2=
links3=
links4=
links5=
date=Last%20updated%203%2F11%2F98
sample=%3Cpre%3E%0D%0AC%20FORMAC%20program%20to%20find%20the%20symbolic%20roots%20of%20some%0D%0AC%20quadratic%20equations.%20%20By%20J.%20Sammet%20from%20the%20HOPL-II%0D%0AC%20paper%20on%20the%20history%20of%20FORMAC%2C%20typos%20corrected.%0D%0A%20%20%20%20%20%20SYMARG%0D%0A%20%20%20%20%20%20ATOMIC%20X%2CY%2CK%0D%0A%20%20%20%20%20%20DIMENSION%20CASE%283%29%2C%20X1%283%29%2C%20x2%283%29%0D%0A%20%20%20%20%20%20LET%20CASE%281%29%20%3D%20X%2A%2A2%20%2B%202%2AX%2A%28Y%2B1%29%20%2B%20%28Y%2B1%29%2A%2A2%0D%0A%20%20%20%20%20%20LET%20CASE%282%29%20%3D%202%20%2A%20X%2A%2A2%20-%204%2AX%0D%0A%20%20%20%20%20%20LET%20CASE%283%29%20%3D%203%2AX%2A%2A2%20%2B%20K%2A%28X%2BX%2A%2A2%2B1%29%20%2B4%0D%0A%20%20%20%20%20%20N%3D3%0D%0A%20%20%20%20%20%20DO%2088%20I%20%3D%201%2CN%0D%0A%20%20%20%20%20%20%20%20%20LET%20RVEXPR%20%3D%20EXPAND%20CASE%28I%29%0D%0A%0D%0A%20%20%20%20%20%20%20%20%20LET%20A%20%3D%20COEFF%20RVEXPR%2CX%2A%2A2%0D%0A%20%20%20%20%20%20%20%20%20LET%20B%20%3D%20COEFF%20RVEXPR%2CX%0D%0A%20%20%20%20%20%20%20%20%20LET%20C%20%3D%20COEFF%20RVEXPR%2CX%2A%2A0%0D%0A%0D%0A%20%20%20%20%20%20%20%20%20LET%20DISCRM%20%3D%20EXPAND%20B%2A%2A2%20-%204%2AA%2AC%0D%0A%20%20%20%20%20%20%20%20%20LET%20X1%28I%29%20%3D%20EXPAND%20%28-B%20%2B%20DISCRM%2A%2A%281%2F2%29%29%2F%282%2AA%29%0D%0A%20%20%20%20%20%20%20%20%20LET%20X2%28I%29%20%3D%20EXPAND%20%28-B%20-%20DISCRM%2A%2A%281%2F2%29%29%2F%282%2AA%29%0D%0A%2088%20%20%20CONTINUE%0D%0A%0D%0A%20%20%20%20%20%20FMCDMP%0D%0A%20%20%20%20%20%20STOP%0D%0A%20%20%20%20%20%20END%0D%0A%3C%2Fpre%3E
_store=1
_add=FORMAC
_usertab=1
_usersearch=0
_format=full
=
name=Forms%2F3
nameURL=http%3A%2F%2Fwww.cs.orst.edu%2F%7Eburnett%2FForms3%2Fforms3.html
see=
logo=203x72%3Dhttp%3A%2F%2Fwww.cs.orst.edu%2F%7Eburnett%2FForms3%2Fformlogo.gif
type=V%20-%20Visual%20or%20graphical
desc=Forms%2F3%20is%20an%20interpreted%0D%0Avisual%20programming%20language%20with%20an%0D%0Aexpression-oriented%20interface%20and%20%0D%0Amostly%20declarative%20semantics.%20%20It%20is%0D%0Aan%20academic%20research%20language.%0D%0A%3Cbr%3E%0D%0AElements%20of%20a%20Forms%2F3%20form%20are%20%0D%0Acalled%20%3Ci%3Ecells%3C%2Fi%3E.%20%20%0D%0ACells%20can%20hold%0D%0Apowerful%20functions.%0D%0AThe%20syntax%20for%20cell%20contents%20is%20fairly%0D%0Asimple%2C%20but%20includes%20fair%20support%20for%0D%0Aarithmetic%20and%20general%20sequential%20%0D%0Aprogramming%2C%20as%20well%20as%20various%0D%0Agraphical%20operations.%20%20Every%20cell%0D%0Ahas%20a%20current%20value.%20%20Data%20types%0D%0Asupported%20in%20Forms%2F3%20are%20strings%2C%20integers%2C%0D%0Areals%2C%20and%20booleans.%20%20%0D%0ACell%20expressions%20can%20directly%20manipulate%0D%0Athe%20appearance%20and%20other%0D%0Acharacteristics%20of%20graphical%20objects%0D%0Ain%20the%20Forms%2F3%20workspace.%0D%0A%3Cbr%3E%0D%0ALike%20many%20other%20visual%20languages%2C%20Forms%2F3%0D%0Aembodies%20a%20notion%20of%20time%3B%20it%20can%20be%20%0D%0Acompared%20to%20a%20visual%20simulation%20system%0D%0Ain%20that%20respect.%20%20Forms%2F3%20allows%20time%0D%0Ato%20be%20run%20both%20forward%20and%20backwards%3B%0D%0Ait%20also%20supports%20semantics%20for%20reacting%0D%0Ato%20asynchronous%20events.%0D%0A%3Cbr%3E%0D%0AOne%20interpreter%20for%20Forms%2F3%20exists%2C%20it%20is%0D%0Awritten%20in%20Common%20Lisp%20and%20runs%20on%20Unix%20%0D%0Aworkstations.%20%20The%20system%20is%20available%20%0D%0Aat%20no%20charge%20from%20the%20authors.
origin=Burnett%20and%20Ambler%2C%201991.
seealso=Lisp%2C%20Logo%2C%20Show-and-Tell%2C%20Cocoa%2C%20SeeDo
remark=Forms%2F3%20is%20the%20successor%20to%20Forms%2F2%20%2889%29%2C%20%0D%0Aalso%0D%0Aby%20M.%20Burnett%20and%20A.%20Ambler%2C%20which%20was%20a%0D%0Asuccessor%20to%20the%20spreadsheet-like%20Forms%20%2886%29%0D%0Alanguage%20by%20A.%20Ambler.%20%20%0D%0AForms%2F3%20is%20a%20research%20language%2C%20used%20to%20%0D%0Astudy%20visual%20programming%20paradigms%2C%20for%0D%0Acomparison%20between%20visual%20and%20traditional%0D%0Aprogramming%20methods%2C%20and%20for%20study%20of%20%0D%0Areversible%20program%20execution%20%28%27time%20travel%27%29.%0D%0A%3Cbr%3E%0D%0ALanguages%20like%20Forms%2F3%20differ%20from%20commercial%0D%0Aso-called%20%27visual%27%20language%20like%20Visual%20Basic%0D%0Ain%20the%20sense%20that%20in%20true%20visual%20languages%2C%0D%0Athe%20actual%20program%20structure%0D%0Aand%20module%20relationships%20are%20created%0D%0Agraphically.%20%20Commercial%20%27visual%27%20languages%0D%0Aare%20more%20like%20language-integrated%20GUI%20%0D%0Abuilders%2C%20although%20some%20convergence%20with%0D%0Aacademic%20visual%20programming%20is%20beginning%0D%0Ato%20occur.
links1=Guided%20Tour%20of%20Forms%2F3%3Dhttp%3A%2F%2Fwww.cs.orst.edu%2F%7Eburnett%2FForms3%2FTour%2Ftour.html
links2=
links3=
links4=
links5=
date=Last%20updated%206%2F12%2F99
sample=This%20is%20an%20example%20program%20from%20the%20Forms%2F3%0D%0Ahome%20page%3A%0D%0A%3Cp%3E%3Ccenter%3E%0D%0A%3Cimg%20src%3D%22http%3A%2F%2Fwww.cs.orst.edu%2F%7Eburnett%2FForms3%2Fppig1b.gif%22%20width%3D364%20height%3D284%3E%0D%0A%3C%2Fcenter%3E%3Cp%3E%0D%0A
_store=1
_add=Forms%2F3
_usertab=1
_usersearch=0
_format=full
=
name=Forth
nameURL=http%3A%2F%2Fwww.forth.org%2F
see=
logo=
type=T%20-%20Threaded%20or%20stack-based
desc=Forth%20is%20an%20interpreted%20stack-based%20language%0D%0Awith%20a%20very%20simple%20syntax%20and%20elegant%0D%0Aabstract%20exection%20model.%20%20%0D%0ADesigned%20for%20efficiency%20and%0D%0Asimplicity%2C%20Forth%20is%20noted%20for%20the%20very%0D%0Asmall%20size%20of%20the%20language%20system.%0D%0A%3Cbr%3E%0D%0AA%20Forth%20program%20is%20a%20sequence%20of%20words.%0D%0AEach%20word%20is%20independent%2C%20and%20causes%0D%0Asome%20specified%20action.%20%20Even%20constants%0D%0Aare%20words%3A%20the%20word%20%2212%22%20is%20just%20a%20command%0D%0Ato%20push%20the%20number%2012%20onto%20the%20data%20stack.%0D%0ASequences%20of%20words%20can%20be%20grouped%20as%0D%0Aprocedures%2C%20and%20employed%20to%20build%20up%0D%0Amodular%20programs.%20%20In%20order%20for%20this%20to%0D%0Awork%2C%20of%20course%2C%20operators%20and%20operands%0D%0Amust%20be%20given%20in%20reverse%20polish%20order%0D%0A%28operands%20followed%20by%20operator%29.%20%20All%0D%0Adata%20manipulation%20takes%20place%20on%20the%0D%0Adata%20stack%2C%20so%20Forth%20offers%20several%0D%0Aoperations%20for%20manipulating%20the%20stack.%0D%0A%3Cbr%3E%0D%0AForth%20implementations%20vary%20in%20the%20range%0D%0Aof%20data%20types%20they%20provide%2C%20but%20most%20provide%0D%0Aa%20conventional%20set%20of%20numeric%20and%20string%0D%0Atypes%2C%20plus%20arrays.%20%20Forth%20offers%20regular%0D%0Acontrol%20structures%3A%20If-Else%2C%20While-Do%2C%20and%0D%0AFor-Next%2C%20albeit%20with%20peculiar%20ordering%0D%0Aof%20the%20keywords.%20%20Most%20dialects%20of%0D%0AForth%20provides%20simple%0D%0Afile%20handling%20and%20I%2FO%20support.%0D%0A%3Cbr%3E%0D%0AForth%20is%20also%20meant%20to%20be%20extensible%20at%20every%0D%0Alevel.%20%20Programmers%20can%20define%20new%20words%2C%0D%0Aand%20implement%20them%20in%20Forth%20itself%2C%20in%0D%0Asome%20other%20high-level%20language%2C%20or%20in%0D%0Amachine%20code.%0D%0A%3Cbr%3E%0D%0AInformation%20about%20Forth%20is%20widely%20%0D%0Aavailable%20on%20the%20Internet.%20%20There%20are%0D%0Aseveral%20commercial%20and%20implementations%2C%0D%0Amany%20available%20from%20%0D%0A%3Ca%20href%3D%22http%3A%2F%2Fforth.org%2Ffig%2Fcompilers.html%22%3Ehere%3C%2Fa%3E.
origin=Charles%20H.%20Moore%2C%201969-1971.
seealso=Postscript
remark=Forth%20is%20often%20employed%20for%20controlling%0D%0Amicro-computers%20and%20embedded%20systems%2C%20%0D%0Aespecially%20at%20boot-up%20prior%20to%20loading%20of%20a%20more%0D%0Acomplex%20OS.%20%20Because%20Forth%20is%20small%20and%0D%0Afast%2C%20it%20is%20well-suited%20for%20embedding%20in%0D%0AROM.%20%20Forth%20is%20also%20used%20for%20creating%0D%0Ageneral-purpose%20applications%2C%20even%0D%0ACGI%20scripts.%0D%0A%3Cbr%3E%0D%0AForth%20is%20standardized%20as%20ANS-Forth%3B%20the%0D%0Astandard%20is%20available%20%0D%0A%3Ca%20href%3D%22ftp%3A%2F%2Fftp.uu.net%2Fvendor%2Fminerva%2Fuathena.htm%22%3Ehere%3C%2Fa%3E.%20%20There%20is%20also%0D%0Aan%20IEEE%20standard%20in%20draft%20for%20using%0D%0AForth%20as%20a%20standard%20firmware%20language%2C%20%0D%0AIEEE%201275.%0D%0A%3Cbr%3E%0D%0AForth%27s%20stream-of-conciousness%20syntax%2C%0D%0Apolymorphism%2C%20%0D%0Aand%20typically%20terse%20style%20make%20reading%0D%0Areal%20Forth%20code%20a%20challenging%20exercise.%0D%0A%3Cbr%3E%0D%0AThe%20first%20real%20application%20of%20what%20we%0D%0Acall%20Forth%20was%20controlling%20telescopes%20at%0D%0Athe%20NRAO%20at%20Kitt%20Peak%2C%20in%201971.%20%20%0D%0AForth%20became%0D%0Avery%20popular%20in%20the%20astronomy%20community%2C%0D%0Aand%20was%20adopted%20as%20the%20standard%20programming%0D%0Alanguage%20by%20the%20International%20Astronomical%0D%0AUnion%20in%201976.%20
links1=Forth%20FAQ%20Lists%3Dhttp%3A%2F%2Fwww.cis.ohio-state.edu%2Fhypertext%2Ffaq%2Fbngusenet%2Fcomp%2Flang%2Fforth%2Ftop.html
links2=Forth%20Information%20page%20at%20Taygeta%20Scientific%3Dhttp%3A%2F%2Fwww.taygeta.com%2Fforth.html
links3=Prof.%20Koopman%27s%20Stack%20Computers%20and%20Forth%20pages%3Dhttp%3A%2F%2Fwww.cs.cmu.edu%2F%7Ekoopman%2Fstack.html
links4=Extensive%20Forth%20Tutorial%3Dhttp%3A%2F%2Fwww.geocities.com%2FSiliconValley%2FBay%2F2334%2F4thtutor.htm
links5=
date=Last%20updated%202%2F28%2F98
sample=%3Cpre%3E%0D%0A%5C%20Forth%20implementation%20of%20Newton%27s%20method%20for%20finding%0D%0A%5C%20roots%2C%20simplified.%20%28c%29%20Copyright%201994%20Everett%20F.%20Carter.%0D%0A%0D%0A%3A%20z1%20%28%20i%20--%20%29%20%28%20f%3A%20--%20z1%20%29%0D%0A%20%20%20%20%20%20z%20F%40%20xn%7B%20SWAP%20%7D%20F%40%20F-%0D%0A%3B%0D%0A%0D%0A%3A%20Newton%20%28%20i%20--%20%29%20%28%20f%3A%20e%20d%20p%20--%20e%20d%20p%20%29%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%5C%20calculate%20new%20D%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20DUP%20z1%20FROT%20F%2A%20FOVER%20F%2B%0D%0A%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%5C%20calculate%20new%20P%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20FSWAP%20DUP%20z1%20F%2A%20dif%7B%20OVER%20%7D%20F%40%20F%2B%0D%0A%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%5C%20calculate%20new%20E%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20FROT%20z1%20FABS%20F%2A%20FOVER%20FABS%20F%2B%0D%0A%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%5C%20restore%20stack%20order%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20FROT%20FROT%0D%0A%3B%0D%0A%0D%0A%3A%20FNewt%20%28%20%26xn%20%26dif%20n%20--%20%29%20%28%20f%3A%20z%20--%20e%20d%20p%29%0D%0A%20%20%20%20%20%20%20%20%3ER%0D%0A%20%20%20%20%20%20%20%20%26%20dif%7B%20%26%21%0D%0A%20%20%20%20%20%20%20%20%26%20xn%7B%20%20%26%21%0D%0A%20%20%20%20%20%20%20%20R%3E%0D%0A%0D%0A%20%20%20%20%20%20%20%20z%20F%21%200.0e0%20%200.0e0%200.0e0%0D%0A%20%20%20%20%20%20%20%200%20DO%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20I%20Newton%0D%0A%20%20%20%20%20%20%20%20%20%20LOOP%0D%0A%3B%0D%0A%3C%2Fpre%3E
_store=1
_add=FORTH
_usertab=1
_usersearch=0
_format=full
=
name=FORTRAN
nameURL=http%3A%2F%2Fwww.fortran.com%2Ffortran%2F
see=
logo=
type=S%20-%20block-structured
desc=FORTRAN%20%28from%20%3Ci%3EFORmula%20TRANSlation%3C%2Fi%3E%29%20is%20one%20of%20the%20oldest%20programming%0D%0Alanguages.%20%20Originally%20developed%20in%20the%20%0D%0Alate%201950s%2C%20FORTRAN%20has%20moved%20through%20many%0D%0Aversions%20and%20is%20still%20popular%20even%20today.%0D%0A%3Cbr%3E%0D%0AFORTRAN%20is%20characterized%20by%20its%20good%20support%0D%0Afor%20mathematics%2C%20especially%20floating-point%20%0D%0Acomputation%2C%20its%20lack%20of%20modular%20programming%0D%0Astructures%2C%20and%20implicit%20declarations%2C%0D%0Aand%20odd%20control-flow%20constructs.%20FORTRAN%0D%0Ais%20normally%20case-insensitive.%20In%20older%0D%0Aversions%20of%20the%20language%2C%20the%0D%0Aposition%20of%20text%20on%20lines%20was%20significant%3B%0D%0AFortran90%20and%20later%20versions%20support%20free-form%0D%0Ainput.%0D%0A%3Cbr%3E%0D%0AFORTRAN%20has%20had%20many%20versions%20over%20the%0D%0Ayears%2C%20some%20of%20the%0D%0Amost%20popular%20being%3A%20FORTRAN%20I%2C%0D%0AFORTRAN%20II%2C%20FORTRAN%20IV%2C%20FORTRAN%2077%2C%20%0D%0Aand%20Fortran90.%20%20The%20current%20standard%0D%0Ais%20Fortran%2095%20%28ISO%2FIEC%201539-1%29%2C%20and%20it%0D%0Aincludes%20many%20modern%20structured%20programming%0D%0Afeatures%20in%20a%20traditional%20Fortran%0D%0Aframework.%20%20%0D%0AMany%0D%0Aspecialized%20and%20parallel-processing%20%0D%0Aversions%20of%20FORTRAN%20have%20also%20been%20created.
origin=John%20Backus%2C%20IBM%2C%201954-57
seealso=C%2C%20PL%2F1%2C%20ACSL
remark=FORTRAN%20has%20long%20been%20a%20language%20of%20choice%0D%0Afor%20complex%20scientific%20calculations%2C%20%0D%0Aengineering%20models%2C%20statistics%2C%20and%20signal%0D%0Aprocessing.%20%20Its%20simple%20code%20structure%20and%0D%0Alack%20of%20dynamic%20data%20structures%20make%20it%0D%0Ahighly%20amenable%20to%20compiler%20optimization%0D%0Aand%20targetting%20to%20special%20hardware%20%28eg.%0D%0Avector%20supercomputers%29.%20%20%0D%0A%3Cbr%3E%0D%0AEvery%20few%20years%2C%20somebody%20predicts%20the%20imminent%20%0D%0Adeath%20of%20FORTRAN%2C%20and%20it%20never%20happens.%0D%0A
links1=Fortran%20Related%20Links%3Dhttp%3A%2F%2Fwww.fortranlib.com%2F
links2=Compaq%20Fortran%20home%20page%3Dhttp%3A%2F%2Fwww.compaq.com%2Ffortran%2F
links3=Fortran%2090%2F95%20Info%20page%3Dhttp%3A%2F%2Fwww.fortran.com%2Fmetcalf.htm
links4=Fortran%2090%20FAQ%3Dftp%3A%2F%2Fftp.ifremer.fr%2Fifremer%2Fditigo%2Ffortran90%2Fengfaq
links5=Official%20home%20of%20Fortran%20standards%3Dhttp%3A%2F%2Fwww.nag.co.uk%2Fsc22wg5%2F
date=Last%20updated%207%2F9%2F01
sample=%3Cpre%3E%0D%0A%20%20%20%20%20%20%20%20PROGRAM%20Rad%0D%0A%21%20Simple%20FORTRAN%20program%0D%0A%20%20%20%20%20%20%20%20REAL%20P%2CR%2CC%0D%0A%20%20%20%20%20%20%20%20IF%20%28.NOT.%20%28R%20%3D%200.0%29%29%20THEN%0D%0A%20%20%20%20%20%20%20%20%20P%20%3D%203.1415926%0D%0A%20%20%20%20%20%20%20%20%20R%20%3D%202.5%0D%0A%20%20%20%20%20%20%20%20%20C%20%3D%20P%20%2A%20R%0D%0A%20%20%20%20%20%20%20%20%20PRINT%20%2A%2C%20%22C%20%3D%20%22%2C%20C%0D%0A%20%20%20%20%20%20%20%20END%20IF%0D%0A%09END%0D%0A%3C%2Fpre%3E
_store=1
_add=FORTRAN
_usertab=1
_usersearch=0
_format=full
=
name=FP
nameURL=
see=
logo=
type=F%20-%20Functional%20or%20lambda-based
desc=FP%20was%20a%20very%20early%20pure-functional%20language%0D%0Ainvented%20by%20Backus.%20%20FP%20was%20an%0D%0Ainterpreted%20language%20that%20attempted%20to%0D%0Abreak%20the%20VonNeumann-machine%20mould.%20%20All%0D%0Acomputations%20in%20FP%20were%20carried%20out%20by%0D%0Aexpressions%20and%20pure%20functions%20%28subroutines%20that%0D%0Areturned%20a%20single%20value%20and%20had%20no%20side%20effects.%29%0D%0ASequences%20and%20combining%20forms%20were%20also%20prominent%0D%0Afeatures%20of%20FP.%0D%0A%3Cbr%3E%0D%0AThe%20language%20also%20included%20a%20fairly%0D%0Anovel%20feature%20of%20an%20explicit%20no-value%0D%0Avalue%20called%20%3Ci%3Ebottom%3C%2Fi%3E.%20%0D%0A%3Cbr%3E%0D%0AFP%20was%0D%0Asucceeded%20by%20FL%20in%201985.
origin=John%20Backus%2C%201977.
seealso=FL%2C%20Haskell%2C%20Clean%2C%20ML%2C%20Hope%2C%20Erlang
remark=FP%20helped%20to%20spawn%20the%20research%20field%0D%0Aof%20functional%20languages%2C%20by%20exhibiting%0D%0Athat%20a%20language%20based%20on%20very%20simple%2C%0D%0Aclean%20semantics%20could%20be%20powerful%20enough%0D%0Ato%20do%20interesting%20work.%20%20Also%2C%20functional%0D%0Aprograms%20can%20be%20reasoned%20about%20in%20a%20formal%0D%0Away%20much%20more%20easily%20than%20most%20conventional%0D%0Alanguage%20programs.%0D%0A%3Cbr%3E%0D%0ASeveral%20implementations%20of%20FP%20existed%20in%20the%0D%0Alate%201970s%20and%20early%2080s.%20%20An%20FP%20%0D%0Ainterpreter%20was%20distributed%20with%0D%0ABerkeley%20UNIX%204.2BSD%2C%20a%20%0D%0Avery%20popular%20UNIX%20implementation%20for%20DEC%0D%0Acomputers.
links1=Portable%20FP%20Compiler%3Dhttp%3A%2F%2Fftp.lth.se%2Farchive%2Fusenet%2Fcomp.sources.unix%2Fvolume20%2Ffpc%2F
links2=
links3=
links4=
links5=
date=Last%20updated%2012%2F3%2F97
sample=%3Cpre%3E%0D%0A%23%20Mergesort%20from%20the%20Berkeley%20FP%20manual%0D%0A%0D%0A%20%20%7B%20mergeSort%20%7C%20merge%20%7D%0D%0A%20%20%7Bmerge%20atEnd%20%40%20mergeHelper%20%40%20%5B%5B%5D%2C%20fixLists%5D%7D%0D%0A%0D%0A%20%20%23%20convert%20atomic%20args%20into%20sequences%0D%0A%20%20%7BfixLists%20%26%28atom%20-%26gt%3B%20%5Bid%5D%20%3B%20id%29%7D%0D%0A%0D%0A%20%20%23%20Merge%20until%20one%20or%20both%20input%20seqs%20are%20empty%0D%0A%20%20%7BmergeHelper%20%28while%20and%20%40%20%26%28not%20%40null%29%20%40%202%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%28firstIsSmaller%20-%26gt%3B%20takeFirst%3B%20takeSecond%29%29%7D%0D%0A%0D%0A%20%20%23%20Find%20seq%20with%20smaller%20first%20element%0D%0A%20%20%7BfirstIsSmaller%20%26lt%3B%20%40%20%5B1%20%40%201%20%40%202%2C%201%20%40%202%20%40%202%5D%7D%0D%0A%0D%0A%20%20%23%20Take%20the%20first%20element%20of%20the%20first%20seq%0D%0A%20%20%7BtakeFirst%20%5Bapndr%20%40%20%5B1%2C1%20%40%201%20%40%202%5D%2C%20%5Btl%20%40%201%20%40%202%2C%202%20%40%202%5D%5D%7D%0D%0A%20%20%23%20Take%20the%20first%20element%20of%20the%20second%20seq%0D%0A%20%20%7BtakeSecond%20%5Bapndr%20%40%20%5B1%2C1%20%40%202%20%40%202%5D%2C%20%5B1%20%40%202%2C%20tl%20%40%202%20%40%202%5D%5D%7D%0D%0A%0D%0A%20%20%23%20Handle%20remaining%20nonempty%20seq%0D%0A%20%20%7BatEnd%20%28firstIsNull%20-%26gt%3B%20concat%20%40%20%5B1%2C2%20%40%202%5D%3B%0D%0A%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20concat%20%40%20%5B1%2C1%20%40%202%5D%29%7D%0D%0A%0D%0A%20%20%7BfirstIsNull%20null%20%40%201%20%40%202%7D%0D%0A%0D%0A%20%20%23%20apply%20the%20function%0D%0A%20%20mergeSort%20%3A%20%26lt%3B0%203%20-2%201%2011%208%20-22%20-33%26gt%3B%0D%0A%3C%2Fpre%3E
_store=1
_add=FP
_usertab=1
_usersearch=0
_format=full
=