Reverse Polish notation

<h2 id="explanation">Explanation</h2>
In reverse Polish notation, the <a href="/facts/Operation_(mathematics)/Yplv602Q">operators</a> follow their <a href="/facts/Operand/HSuUzrKz">operands</a>. For example, to add 3 and 4 together, the expression is 3 4 + rather than 3 + 4. The conventional notation expression 3 − 4 + 5 becomes 3 (enter) 4 − 5 + in reverse Polish notation: 4 is first subtracted from 3, then 5 is added to it.
The concept of a <a href="/facts/Stack_(data_structure)/bj7l94v1">stack</a>, a last-in/first-out construct, is integral to the left-to-right evaluation of RPN. In the example 3 4 −, first the 3 is put onto the stack, then the 4; the 4 is now on top and the 3 below it. The subtraction operator removes the top two items from the stack, performs 3 − 4, and puts the result of −1 onto the stack.
The common terminology is that added items are pushed on the stack and removed items are popped.
The advantage of reverse Polish notation is that it removes the need for order of operations and parentheses that are required by <a href="/facts/Infix_notation/LY0dMhay">infix notation</a> and can be evaluated linearly, left-to-right. For example, the infix expression (3 + 4) × (5 + 6) becomes 3 4 + 5 6 + × in reverse Polish notation.

<h2 id="practical-implications">Practical implications</h2>
Reverse Polish notation has been compared to how one had to work through problems with a <a href="/facts/Slide_rule/KzIEdWad">slide rule</a>.<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>
In comparison, testing of reverse Polish notation with algebraic notation, reverse Polish has been found to lead to faster calculations, for two reasons. The first reason is that reverse Polish calculators do not need expressions to be parenthesized, so fewer operations need to be entered to perform typical calculations. Additionally, users of reverse Polish calculators made fewer mistakes than for other types of calculators.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a><a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> Later research clarified that the increased speed from reverse Polish notation may be attributed to the smaller number of keystrokes needed to enter this notation, rather than to a smaller cognitive load on its users.<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> However, anecdotal evidence suggests that reverse Polish notation is more difficult for users who previously learned algebraic notation.<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a>

<h2 id="converting-from-infix-notation">Converting from infix notation</h2>
Main article: <a href="/facts/Shunting-yard_algorithm/zIsL1fLk">Shunting-yard algorithm</a>
<a href="/facts/Edsger_W._Dijkstra/910x0MjT">Edsger W. Dijkstra</a> invented the <a href="/facts/Shunting-yard_algorithm/zIsL1fLk">shunting-yard algorithm</a> to convert infix expressions to postfix expressions (reverse Polish notation), so named because its operation resembles that of a <a href="/facts/Classification_yard/GrRCVyY1">railroad shunting yard</a>.
There are other ways of producing postfix expressions from infix expressions. Most <a href="/facts/Operator-precedence_parser/YHfocsFq">operator-precedence parsers</a> can be modified to produce postfix expressions; in particular, once an <a href="/facts/Abstract_syntax_tree/73AUK1jI">abstract syntax tree</a> has been constructed, the corresponding postfix expression is given by a simple <a href="/facts/Post-order_traversal/Dkch34pz">post-order traversal</a> of that tree.

<h2 id="implementations">Implementations</h2>
<h3>Hardware calculators</h3>
<h4>Early history</h4>
The first computer implementing a form of reverse Polish notation (but without the name and also without a <a href="/facts/Stack_machine/IBtk4NRA">stack</a>), was <a href="/facts/Konrad_Zuse/yrvbaEg3">Konrad Zuse</a>'s <a href="/facts/Z3_(computer)/JNPXGqDp">Z3</a>, which he started to construct in 1938 and demonstrated publicly on 12 May 1941.<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a><a class="footnote-ref" id="fnref:24" href="#fn:24">24</a><a class="footnote-ref" id="fnref:25" href="#fn:25">25</a><a class="footnote-ref" id="fnref:26" href="#fn:26">26</a> In dialog mode, it allowed operators to enter two operands followed by the desired operation.<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a> It was destroyed on 21 December 1943 in a bombing raid.<a class="footnote-ref" id="fnref:28" href="#fn:28">28</a> With Zuse's help a first replica was built in 1961.<a class="footnote-ref" id="fnref:29" href="#fn:29">29</a> The 1945 <a href="/facts/Z4_(computer)/RNjK5G7f">Z4</a> also added a 2-level <a href="/facts/Stack_machine/IBtk4NRA">stack</a>.<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a><a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>
Other early computers to implement architectures enabling reverse Polish notation were the <a href="/facts/English_Electric_Company/ojz9aXNh">English Electric Company</a>'s <a href="/facts/English_Electric_KDF9/dL86KwG2">KDF9</a> machine, which was announced in 1960 and commercially available in 1963,<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a> and the <a href="/facts/Burroughs_B5000/FwY7EqrB">Burroughs B5000</a>, announced in 1961 and also delivered in 1963:
Presumably, the KDF9 designers drew ideas from Hamblin's <a href="/facts/GEORGE_(autocode_system)/aXjaytN4">GEORGE</a> (General Order Generator),<a class="footnote-ref" id="fnref:33" href="#fn:33">33</a><a class="footnote-ref" id="fnref:34" href="#fn:34">34</a><a class="footnote-ref" id="fnref:35" href="#fn:35">35</a><a class="footnote-ref" id="fnref:36" href="#fn:36">36</a><a class="footnote-ref" id="fnref:37" href="#fn:37">37</a><a class="footnote-ref" id="fnref:38" href="#fn:38">38</a> an <a href="/facts/Autocode/6ITEG7sR">autocode</a> programming system written for a <a href="/facts/English_Electric_DEUCE/UCVl6TQH">DEUCE</a> computer installed at the <a href="/facts/University_of_Sydney/AzENnAra">University of Sydney</a>, Australia, in 1957.<a class="footnote-ref" id="fnref:39" href="#fn:39">39</a><a class="footnote-ref" id="fnref:40" href="#fn:40">40</a><a class="footnote-ref" id="fnref:41" href="#fn:41">41</a><a class="footnote-ref" id="fnref:42" href="#fn:42">42</a>
One of the designers of the B5000, <a href="/facts/Robert_S._Barton/g87nIqBX">Robert S. Barton</a>, later wrote that he developed reverse Polish notation independently of Hamblin sometime in 1958 after reading a 1954 textbook on symbolic logic by <a href="/facts/Irving_Copi/vFrXV2UN">Irving Copi</a>,<a class="footnote-ref" id="fnref:43" href="#fn:43">43</a><a class="footnote-ref" id="fnref:44" href="#fn:44">44</a><a class="footnote-ref" id="fnref:45" href="#fn:45">45</a> where he found a reference to Polish notation,<a class="footnote-ref" id="fnref:46" href="#fn:46">46</a> which made him read the works of Jan Łukasiewicz as well,<a class="footnote-ref" id="fnref:47" href="#fn:47">47</a> and before he was aware of Hamblin's work.
<a href="/facts/Friden%2c_Inc./BS32Qmsp">Friden</a> introduced reverse Polish notation to the desktop calculator market with the <a href="/facts/Friden_EC-130/BS32Qmsp">EC-130</a>, designed by <a href="/facts/Bob_Ragen/BS32Qmsp">Robert "Bob" Appleby Ragen</a>,<a class="footnote-ref" id="fnref:48" href="#fn:48">48</a> supporting a four-level stack<a class="footnote-ref" id="fnref:49" href="#fn:49">49</a> in June 1963.<a class="footnote-ref" id="fnref:50" href="#fn:50">50</a> The successor <a href="/facts/Friden_EC-132/BS32Qmsp">EC-132</a> added a square root function in April 1965.<a class="footnote-ref" id="fnref:51" href="#fn:51">51</a> Around 1966, the <a href="/facts/Monroe_Epic/9uc4zmgw">Monroe Epic</a> calculator supported an unnamed input scheme resembling RPN as well.<a class="footnote-ref" id="fnref:52" href="#fn:52">52</a>

<h4>Hewlett-Packard</h4>
Main article: <a href="/facts/HP_calculators/4LTUUvHS">HP calculators</a>

<a href="/facts/Hewlett-Packard/abuNSYNu">Hewlett-Packard</a> engineers designed the <a href="/facts/Hewlett-Packard_9100A/Tvm11Jy1">9100A Desktop Calculator</a> in 1968 with reverse Polish notation<a class="footnote-ref" id="fnref:53" href="#fn:53">53</a> with only three stack levels with working registers X ("keyboard"), Y ("accumulate") and visible storage register Z ("temporary"),<a class="footnote-ref" id="fnref:54" href="#fn:54">54</a><a class="footnote-ref" id="fnref:55" href="#fn:55">55</a> a reverse Polish notation variant later referred to as three-level RPN.<a class="footnote-ref" id="fnref:56" href="#fn:56">56</a> This calculator popularized reverse Polish notation among the scientific and engineering communities.
The <a href="/facts/HP-35/EKPVBVe1">HP-35</a>, the world's first handheld scientific <a href="/facts/Calculator/eeLfRS8L">calculator</a>,<a class="footnote-ref" id="fnref:57" href="#fn:57">57</a> introduced the classical four-level RPN with its specific ruleset of the so-called operational (memory) stack<a class="footnote-ref" id="fnref:58" href="#fn:58">58</a><a class="footnote-ref" id="fnref:59" href="#fn:59">59</a> (later also called automatic memory stack<a class="footnote-ref" id="fnref:60" href="#fn:60">60</a><a class="footnote-ref" id="fnref:61" href="#fn:61">61</a><a class="footnote-ref" id="fnref:62" href="#fn:62">62</a>) in 1972.<a class="footnote-ref" id="fnref:63" href="#fn:63">63</a> In this scheme, the Enter ↑ key duplicates values into Y under certain conditions (automatic stack lift with temporary stack lift disable), and the top register T ("top") gets duplicated on drops (top copy on pop aka top stack level repetition) in order to ease some calculations and to save keystrokes.<a class="footnote-ref" id="fnref:64" href="#fn:64">64</a> HP used reverse Polish notation on every handheld calculator it sold, whether scientific, financial, or programmable, until it introduced the HP-10 <a href="/facts/Adding_machine/oyHBLrrs">adding machine</a> calculator in 1977. By this time, HP was the leading manufacturer of calculators for professionals, including engineers and accountants.
Later calculators with LCDs in the early 1980s, such as the <a href="/facts/HP-10C/mD1XeerK">HP-10C</a>, <a href="/facts/HP-11C/mD1XeerK">HP-11C</a>, <a href="/facts/HP-15C/mMCWV7y3">HP-15C</a>, <a href="/facts/HP-16C/qMnRzNaz">HP-16C</a>, and the financial <a href="/facts/HP-12C/e3TtbDdM">HP-12C</a> calculator also used reverse Polish notation. In 1988, Hewlett-Packard introduced a business calculator, the <a href="/facts/HP-19B/e9KausbB">HP-19B</a>, without reverse Polish notation, but its 1990 successor, the <a href="/facts/HP-19BII/e9KausbB">HP-19BII</a>, gave users the option of using algebraic or reverse Polish notation again.
In 1986,<a class="footnote-ref" id="fnref:65" href="#fn:65">65</a><a class="footnote-ref" id="fnref:66" href="#fn:66">66</a> HP introduced <a href="/facts/RPL_(programming_language)/JqMsmMWp">RPL</a>, an object-oriented successor to reverse Polish notation. It deviates from classical reverse Polish notation by using a dynamic stack only limited by the amount of available memory (instead of three or four fixed levels) and which could hold all kinds of data objects (including symbols, strings, lists, matrices, graphics, programs, etc.) instead of just numbers. The system would display an error message when running out of memory instead of just dropping values off the stack on overflow as with fixed-sized stacks.<a class="footnote-ref" id="fnref:67" href="#fn:67">67</a> It also changed the behaviour of the stack to no longer duplicate the top register on drops (since in an unlimited stack there is no longer a top register) and the behaviour of the Enter ↑ key so that it no longer duplicated values into Y, which had shown to sometimes cause confusion among users not familiar with the specific properties of the automatic memory stack. From 1990 to 2003, HP manufactured the <a href="/facts/HP-48_series/FonQov9J">HP-48 series</a> of graphing RPL calculators, followed by the <a href="/facts/HP-49_series/CHJ2toxY">HP-49 series</a> between 1999 and 2008. The last RPL calculator was named <a href="/facts/HP_50g/CHJ2toxY">HP 50g</a>, introduced in 2006 and discontinued in 2015. However, there are several community efforts like <a href="/facts/NewRPL/JqMsmMWp">newRPL</a> or <a href="/facts/DB48X/JqMsmMWp">DB48X</a> to recreate RPL on modern calculators.
As of 2011, Hewlett-Packard was offering the calculator models 12C, 12C Platinum, <a href="/facts/HP_17bII%252B/p6RRAq2D">17bII+</a>, <a href="/facts/HP_20b/1YSoeaKs">20b</a>, <a href="/facts/HP_30b/gUkEEXed">30b</a>, <a href="/facts/HP_33s/tTLXVNTY">33s</a>, <a href="/facts/HP_35s/pPyHeqXf">35s</a>, <a href="/facts/HP_48gII/CHJ2toxY">48gII</a> (RPL) and 50g (RPL) which support reverse Polish notation.<a class="footnote-ref" id="fnref:68" href="#fn:68">68</a>
While calculators emulating classical models continued to support classical reverse Polish notation, new reverse Polish notation models feature a variant of reverse Polish notation, where the Enter ↑ key behaves as in RPL. This latter variant is sometimes known as entry RPN.<a class="footnote-ref" id="fnref:69" href="#fn:69">69</a>
In 2013, the <a href="/facts/HP_Prime/czJje3Ne">HP Prime</a> introduced a 128-level form of entry RPN called advanced RPN. In contrast to RPL with its dynamic stack, it just drops values off the stack on overflow like other fixed-sized stacks do.<a class="footnote-ref" id="fnref:70" href="#fn:70">70</a> However, like RPL, it does not emulate the behaviour of a classical operational RPN stack to duplicate the top register on drops.
In late 2017, the list of active models supporting reverse Polish notation included only the 12C, 12C Platinum, 17bii+, 35s, and Prime. By July 2023, only the 12C, 12C Platinum, the freshly released <a href="/facts/HP_15C_Collector%2527s_Edition/mMCWV7y3">HP 15C Collector's Edition</a>, and the Prime remain active models supporting RPN.

See also: HP-related community-developed calculators
<h4>Sinclair Radionics</h4>
In Britain, <a href="/facts/Clive_Sinclair/t5eqanJQ">Clive Sinclair</a>'s <a href="/facts/Sinclair_Scientific/CWUndfAh">Sinclair Scientific</a> (1974) and <a href="/facts/Sinclair_Scientific_Programmable/CWUndfAh">Scientific Programmable</a> (1975) models used reverse Polish notation.<a class="footnote-ref" id="fnref:71" href="#fn:71">71</a><a class="footnote-ref" id="fnref:72" href="#fn:72">72</a>

<h4>Commodore</h4>
In 1974, <a href="/facts/Commodore_Business_Machines/SlfXKbCN">Commodore</a> produced the Minuteman *6 (MM6) without an Enter ↑ key and the Minuteman *6X (MM6X) with an Enter ↑ key, both implementing a form of two-level RPN. The SR4921 RPN came with a variant of four-level RPN with stack levels named X, Y, Z, and W (rather than T) and an Ent key (for "entry"). In contrast to Hewlett-Packard's reverse Polish notation implementation, W filled with 0 instead of its contents being duplicated on stack drops.<a class="footnote-ref" id="fnref:73" href="#fn:73">73</a>

<h4>Prinztronic</h4>
Prinz and Prinztronic were own-brand trade names of the British <a href="/facts/Dixons_Retail/G3eDRLEe">Dixons</a> photographic and electronic goods stores retail chain, later rebranded as <a href="/facts/Currys_Digital/To9IoIuI">Currys Digital</a> stores, and became part of DSG International. A variety of calculator models was sold in the 1970s under the Prinztronic brand, all made for them by other companies.
Among these was the PROGRAM<a class="footnote-ref" id="fnref:74" href="#fn:74">74</a> Programmable Scientific Calculator which featured reverse Polish notation.

<h4>Heathkit</h4>
The Aircraft Navigation Computer <a href="/facts/Heathkit_OC-1401/UzElPd6X">Heathkit OC-1401</a>/<a href="/facts/Heathkit_OCW-1401/UzElPd6X">OCW-1401</a> used five-level RPN in 1978.

<h4>Soviet Union / Semico</h4>
<a href="/facts/Soviet_Union/m7wWsPto">Soviet</a> programmable calculators (<a href="/facts/MK-52/LgVBtjMU">MK-52</a>, <a href="/facts/MK-61/JPgNzchg">MK-61</a>, <a href="/facts/Elektronika_B3-34/lBclLGwx">B3-34</a> and earlier <a href="/facts/B3-21/wrY74vtp">B3-21</a><a class="footnote-ref" id="fnref:75" href="#fn:75">75</a> models) used reverse Polish notation for both automatic mode and programming. Modern Russian calculators MK-161<a class="footnote-ref" id="fnref:76" href="#fn:76">76</a> and MK-152,<a class="footnote-ref" id="fnref:77" href="#fn:77">77</a> designed and manufactured in <a href="/facts/Novosibirsk/8UImC3vI">Novosibirsk</a> since 2007 and offered by Semico,<a class="footnote-ref" id="fnref:78" href="#fn:78">78</a> are backwards compatible with them. Their extended architecture is also based on reverse Polish notation.

<h4>Others</h4>
<ul><li>A seven-level stack had been implemented in the <a href="/facts/MITS_7400C/c0XWUYIl">MITS 7400C</a> scientific desktop calculator in 1972<a class="footnote-ref" id="fnref:79" href="#fn:79">79</a><a class="footnote-ref" id="fnref:80" href="#fn:80">80</a><a class="footnote-ref" id="fnref:81" href="#fn:81">81</a></li>
<li><a href="/facts/National_Semiconductor/xeAD8doA">National Semiconductor</a> 4615 and 4640</li>
<li>Novus 650 Mathbox, 3500 Sliderule, 4510 Mathematician, 4515 Mathematician PRO/RG, 4520 Scientist and 4525 Scientist PR</li>
<li>Some <a href="/facts/APF_Electronics_Inc./WlgAnfVY">APF</a> calculators like the Mark 55 (1976)<a class="footnote-ref" id="fnref:82" href="#fn:82">82</a></li>
<li><a href="/facts/SwissMicros/mD1XeerK">SwissMicros</a> (originally firming as RPN-Calc) calculators including the <a href="/facts/SwissMicros_DM-10CC/mD1XeerK">DM-10CC</a> (2012), <a href="/facts/SwissMicros_DM-11CC/mD1XeerK">DM-11CC</a> (2012), <a href="/facts/SwissMicros_DM-12CC/e3TtbDdM">DM-12CC</a> (2012), <a href="/facts/SwissMicros_DM-15CC/mMCWV7y3">DM-15CC</a> (2012), <a href="/facts/SwissMicros_DM-16CC/qMnRzNaz">DM-16CC</a> (2012), <a href="/facts/SwissMicros_DM10/mD1XeerK">DM10</a> (2013), <a href="/facts/SwissMicros_DM11/mD1XeerK">DM11</a> (2013), <a href="/facts/SwissMicros_DM12/e3TtbDdM">DM12</a> (2013), <a href="/facts/SwissMicros_DM15/mMCWV7y3">DM15</a> (2013), <a href="/facts/SwissMicros_DM16/qMnRzNaz">DM16</a> (2013), <a href="/facts/SwissMicros_DM10L/mD1XeerK">DM10L Collector's Edition</a> (2020), <a href="/facts/SwissMicros_DM11L/mD1XeerK">DM11L</a> (2016), <a href="/facts/SwissMicros_DM12L/e3TtbDdM">DM12L</a> (2016), <a href="/facts/SwissMicros_DM15L/mMCWV7y3">DM15L</a> (2015), <a href="/facts/SwissMicros_DM16L/qMnRzNaz">DM16L</a> (2015), <a href="/facts/SwissMicros_DM41/wDvgAk9U">DM41</a> (2015), <a href="/facts/SwissMicros_DM41L/wDvgAk9U">DM41L</a> (2015), <a href="/facts/SwissMicros_DM41X/wDvgAk9U">DM41X</a> (2020), <a href="/facts/SwissMicros_DM42/8rLzNsHx">DM42</a> (2017) and <a href="/facts/SwissMicros_DM32/D08Bq9hu">DM32</a> (2023).</li></ul>
<h4>Community-developed hardware-based calculators</h4>
See also: Hewlett-Packard RPN calculators
An eight-level stack was suggested by John A. Ball in 1978.<a class="footnote-ref" id="fnref:83" href="#fn:83">83</a>
The community-developed calculators <a href="/facts/WP_34S/gUkEEXed">WP 34S</a> (2011), <a href="/facts/WP_31S/gUkEEXed">WP 31S</a> (2014) and <a href="/facts/WP_34C/gUkEEXed">WP 34C</a> (2015), which are based on the <a href="/facts/HP_20b/1YSoeaKs">HP 20b</a>/<a href="/facts/HP_30b/gUkEEXed">HP 30b</a> hardware platform, support classical Hewlett-Packard-style reverse Polish notation supporting automatic stack lift behaviour of the Enter ↑ key and top register copies on pops, but switchable between a four- and an eight-level operational stack.
In addition to the optional support for an eight-level stack, the newer <a href="/facts/SwissMicros_DM42/8rLzNsHx">SwissMicros DM42</a>-based <a href="/facts/WP_43S/8rLzNsHx">WP 43S</a> as well as the <a href="/facts/WP_43C/8rLzNsHx">WP 43C</a> (2019) / <a href="/facts/C43_(calculator)/8rLzNsHx">C43</a> (2022) / <a href="/facts/C47_(calculator)/8rLzNsHx">C47</a> (2023) derivatives support data types for stack objects (real numbers, infinite integers, finite integers, complex numbers, strings, matrices, dates and times). The latter three variants can also be switched between classical and entry RPN behaviour of the Enter ↑ key, a feature often requested by the community.<a class="footnote-ref" id="fnref:84" href="#fn:84">84</a> They also support a rarely seen <a href="/facts/Significant_figure/RUfYtpgo">significant figures</a> mode, which had already been available as a compile-time option for the WP 34S and WP 31S.<a class="footnote-ref" id="fnref:85" href="#fn:85">85</a><a class="footnote-ref" id="fnref:86" href="#fn:86">86</a>
Since 2021, the <a href="/facts/HP-42S/8rLzNsHx">HP-42S</a> simulator <a href="/facts/Free42/8rLzNsHx">Free42</a> version 3 can be enabled to support a dynamic RPN stack only limited by the amount of available memory instead of the classical 4-level stack. This feature was incorporated as a selectable function into the DM42 since firmware DMCP-3.21 / DM42-3.18.<a class="footnote-ref" id="fnref:87" href="#fn:87">87</a><a class="footnote-ref" id="fnref:88" href="#fn:88">88</a>

<h3>Software calculators</h3>
Software calculators:

<ul><li><a href="/facts/Atari_Calculator/9bRpWpMA">Atari Calculator</a></li>
<li><a href="/facts/Calculator_(macOS)/yMRPvvPW">Mac OS X Calculator</a></li>
<li>Several Apple <a href="/facts/IPhone/h5WeKRl9">iPhone</a> applications e.g. "reverse polish notation calculator"</li>
<li>Several <a href="/facts/Android_(operating_system)/nNyHb0xz">Android</a> applications e.g. "RealCalc"</li>
<li>Several <a href="/facts/Windows_10_Mobile/JGjuL0fl">Windows 10 Mobile</a> applications e.g. "RPN9"</li>
<li><a href="/facts/Unix/0pNL2seI">Unix system</a> calculator program <a href="/facts/Dc_(computer_program)/bzeN0TwH">dc</a></li>
<li><a href="/facts/Emacs/BvGxuAxQ">Emacs</a> lisp library package calc</li>
<li><a href="/facts/X.Org_Server/7AaPmYtV">Xorg</a> calculator (<a href="/facts/Xcalc/YGJCfVRM">xcalc</a>)</li>
<li>ARPCalc,<a class="footnote-ref" id="fnref:89" href="#fn:89">89</a> a powerful scientific/engineering RPN calculator for Windows, Linux and Android that also has a web-browser based version</li>
<li>grpn<a class="footnote-ref" id="fnref:90" href="#fn:90">90</a> scientific/engineering calculator using the GIMP Toolkit (<a href="/facts/GTK%252B/oLpVm9pp">GTK+</a>)</li>
<li>F-Correlatives in <a href="/facts/MultiValue/csrAQ5Pe">MultiValue</a> dictionary items</li>
<li><a href="/facts/RRDtool/0W7ndb1k">RRDtool</a>, a widely used tabulating and graphing software</li>
<li>grdmath, a program for algebraic operations on <a href="/facts/NetCDF/DUwTEW7n">NetCDF</a> grids, part of <a href="/facts/Generic_Mapping_Tools/hvmC0R5r">Generic Mapping Tools</a> (GMT) suite</li>
<li>galculator,<a class="footnote-ref" id="fnref:91" href="#fn:91">91</a> a GTK desktop calculator</li>
<li>Mouseless Stack-Calculator<a class="footnote-ref" id="fnref:92" href="#fn:92">92</a> scientific/engineering calculator including complex numbers</li>
<li>rpCalc,<a class="footnote-ref" id="fnref:93" href="#fn:93">93</a> a simple reverse polish notation calculator written in <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a> for Linux and MS Windows and published under the <a href="/facts/GNU_General_Public_License/S75KhLSX">GNU GPLv2</a> license</li>
<li>orpie, RPN calculator for the terminal for real or complex numbers or matrices</li>
<li><a href="/facts/Qalculate!/JNl0IKnI">Qalculate!</a>, a powerful and versatile cross-platform desktop calculator</li>
<li><a href="/facts/WRPN_Calculator/2DnbyNFc">WRPN Calculator</a></li></ul>
<h3>Programming languages</h3>
Existing implementations using reverse Polish notation include:

<ul><li><a href="/facts/Stack-oriented_programming_language/RFhFMhuj">Stack-oriented programming languages</a> such as:
<ul><li><a href="/facts/Forth_(programming_language)/mYtWVNhF">Forth</a></li>
<li><a href="/facts/Dc_(programming_language)/bzeN0TwH">dc</a></li>
<li><a href="/facts/STOIC/Qc7yNl8Y">STOIC</a></li>
<li><a href="/facts/Factor_(programming_language)/oSKmJ26c">Factor</a></li>
<li><a href="/facts/PostScript/4EeEtnLv">PostScript</a> page description language<a class="footnote-ref" id="fnref:94" href="#fn:94">94</a><a class="footnote-ref" id="fnref:95" href="#fn:95">95</a></li>
<li><a href="/facts/BibTeX/xakIAcCb">BibTeX</a> style files<a class="footnote-ref" id="fnref:96" href="#fn:96">96</a></li>
<li><a href="/facts/Befunge/zRtCXF0f">Befunge</a></li>
<li><a href="/facts/Joy_(programming_language)/R6s5dz7V">Joy</a></li>
<li><a href="/facts/IPTSCRAE/c5Q2NNEM">IPTSCRAE</a></li>
<li><a href="/facts/Lotus_1-2-3/tnkvSG3M">Lotus 1-2-3</a> and <a href="/facts/Lotus_Symphony_(DOS)/mzQ0mh3u">Lotus Symphony</a> formulas<a class="footnote-ref" id="fnref:97" href="#fn:97">97</a><a class="footnote-ref" id="fnref:98" href="#fn:98">98</a></li>
<li><a href="/facts/RPL_(Samurai_Software)/gPpXka1B">RPL</a> (aka Reverse Polish Language), a programming language for the <a href="/facts/Commodore_PET/08R12Xk4">Commodore PET</a> around 1979/1981</li>
<li><a href="/facts/RPL_(programming_language)/JqMsmMWp">RPL</a> (aka Reverse Polish Lisp), a programming language for <a href="/facts/Hewlett-Packard/abuNSYNu">Hewlett-Packard</a> calculators between 1986 and 2015<a class="footnote-ref" id="fnref:99" href="#fn:99">99</a><a class="footnote-ref" id="fnref:100" href="#fn:100">100</a></li>
<li>RPNL (Reverse Polish Notation Language)<a class="footnote-ref" id="fnref:101" href="#fn:101">101</a><a class="footnote-ref" id="fnref:102" href="#fn:102">102</a></li></ul></li>
<li>Class libraries
<ul><li>TRURL,<a class="footnote-ref" id="fnref:103" href="#fn:103">103</a> a class library for the construction of RPN calculators in <a href="/facts/Object_Pascal/cuGkuISv">Object Pascal</a></li></ul></li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Calculator_input_methods/wHvnrfJx">Calculator input methods</a></li>
<li><a href="/facts/FOCAL_keystroke_programming/wDvgAk9U">FOCAL keystroke programming</a></li>
<li><a href="/facts/Stack_machine/IBtk4NRA">Stack machine</a></li>
<li><a href="/facts/Head-directionality_parameter/mAlsSSc6">Head-directionality parameter</a></li>
<li><a href="/facts/Scrambling_(linguistics)/nYToXvHF">Scrambling (linguistics)</a></li>
<li><a href="/facts/Subject_object_verb/yqAybkWr">Subject object verb</a> and <a href="/facts/Object_subject_verb/51oGjDl6">Object subject verb</a></li></ul>
<h2 id="notes">Notes</h2>

<h2 id="further-reading">Further reading</h2>
<ul><li>Brown, Bob (2015-06-05) [April 2001]. <a href="http://bbrown.kennesaw.edu/web_lectures/postfix/">"Postfix Notation Mini-Lecture"</a>. Information Technology Department, College of Computing and Software Engineering, <a href="/facts/Kennesaw_State_University/GTfqS5jU">Kennesaw State University</a>. <a href="https://web.archive.org/web/20170624164922/http://ksuweb.kennesaw.edu/faculty/rbrow211/web_lectures/postfix/">Archived</a> from the original on 2017-06-24. Retrieved 2015-09-12.</li>
<li><a href="http://archive.computerhistory.org/resources/access/text/2016/05/102651973-05-01-acc.pdf">"Advanced Calculator Logic HP RPN/Algebraic: A Comparative Analysis"</a> (PDF). Corvallis, Oregon, USA: <a href="/facts/Hewlett-Packard_Corporation/abuNSYNu">Hewlett-Packard Corporation</a>. 1979. 5953-1930. <a href="https://web.archive.org/web/20221226175054/http://archive.computerhistory.org/resources/access/text/2016/05/102651973-05-01-acc.pdf">Archived</a> (PDF) from the original on 2022-12-26. Retrieved 2022-12-26. (13 pages)</li>
<li>Hicks, David G. (2013) [1995]. <a href="http://hpmuseum.org/rpn.htm">"What is RPN?"</a>. The Museum of HP Calculators (MoHPC). <a href="https://web.archive.org/web/20170624165003/http://hpmuseum.org/rpn.htm">Archived</a> from the original on 2017-06-24. Retrieved 2015-09-12.</li>
<li>Klaver, Hans (2023-08-14) [2014]. <a href="https://klaverscholten.nl/rpn/index.html">"RPN Tutorial, incl. some things HP did not tell"</a>. Netherlands. <a href="https://web.archive.org/web/20230923125928/https://klaverscholten.nl/rpn/index.html">Archived</a> from the original on 2023-09-23. Retrieved 2015-09-12.</li>
<li>Kreifeldt, John G. (October 1981). "Hand Calculator Performance Under Interrupted Operation". Proceedings of the Human Factors Society Annual Meeting. 25 (1). Department of Engineering Design, Tufts University, Medford, Massachusetts, USA: 329–332. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1177%2F107118138102500187">10.1177/107118138102500187</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:106904297">106904297</a>. (4 pages)</li>
<li>Kreifeldt, John G.; McCarthy, Mary E. (1981-10-15) [1981-06-16/18]. Written at Department of Engineering Design, Tufts University, Medford, Massachusetts, USA. <a href="https://ntrs.nasa.gov/api/citations/19820005848/downloads/19820005848.pdf">Interruption as a test of the user-computer interface</a> (PDF). Proceedings of the Seventeenth Annual Conference on Manual Control. University of California, Los Angeles, California, USA: <a href="/facts/Jet_Propulsion_Laboratory/zPXnxRBf">Jet Propulsion Laboratory</a> / <a href="/facts/Office_of_Naval_Research/qKug0oD2">Office of Naval Research</a> / <a href="/facts/NASA/TIMCV0yV">NASA</a>. pp. 655–667. 02155, N82-13721, 82N13721, 19820005848, JPL 81-95. <a href="https://web.archive.org/web/20220130063534/https://ntrs.nasa.gov/api/citations/19820005848/downloads/19820005848.pdf">Archived</a> (PDF) from the original on 2022-01-30. Retrieved 2018-09-22. <a href="https://books.google.com/books?id=dHZKAQAAMAAJ">[5]</a> (13 of 702 pages)</li>
<li>Redin, James (2005-02-12) [1997-10-05]. <a href="http://www.xnumber.com/xnumber/rpn_or_adl.htm">"RPN or DAL? A brief analysis of Reverse Polish Notation against Direct Algebraic Logic"</a>. <a href="https://web.archive.org/web/20170624164945/http://www.xnumber.com/xnumber/rpn_or_adl.htm">Archived</a> from the original on 2017-06-24. Retrieved 2015-09-12.</li>
<li>Vanderbeek, Greg (July 2007). <a href="https://digitalcommons.unl.edu/cgi/viewcontent.cgi?article=1045&context=mathmidexppap">Order of Operations and RPN</a> (Expository paper). Master of Arts in Teaching (MAT) Exam Expository Papers. Lincoln, USA: <a href="/facts/University_of_Nebraska/J43EEWSI">University of Nebraska</a>. Paper 46. <a href="https://web.archive.org/web/20200614191608/https://digitalcommons.unl.edu/cgi/viewcontent.cgi?article=1045&context=mathmidexppap">Archived</a> from the original on 2020-06-14. Retrieved 2020-06-14.</li>
<li><a href="/facts/Niklaus_Wirth/krsLUB11">Wirth, Niklaus</a> (2005-06-15) [2005-02-02]. <a href="http://www.inf.ethz.ch/~wirth/Articles/GoodIdeas_origFig.pdf">"Good Ideas, Through the Looking Glass"</a> (PDF). Zürich, Switzerland. <a href="https://web.archive.org/web/20170624164254/https://www.inf.ethz.ch/personal/wirth/Articles/GoodIdeas_origFig.pdf">Archived</a> (PDF) from the original on 2017-06-24. Retrieved 2015-09-12.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="http://rosettacode.org/wiki/Parsing/RPN_calculator_algorithm">Rosettacode.org</a> providing many implementations in several programming languages.</li>
<li><a href="http://rpn.codeplex.com/">http://rpn.codeplex.com/</a> Implementation of RPN with custom functions support and flexible list of operators.</li>
<li><a href="https://xrjunque.nom.es/ConvertAlg2RPN_RPL.aspx">https://xrjunque.nom.es/ConvertAlg2RPN_RPL.aspx</a> Free online Algebraic expression to RPN Converter</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Łukasiewicz, Jan (1951). "Chapter IV. Aristotle's System in Symbolic Form (section on "Explanation of the Symbolism")". Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (1 ed.). p. 78. <a href="/wiki/Jan_%C5%81ukasiewicz" target="_blank">/wiki/Jan_%C5%81ukasiewicz</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Łukasiewicz, Jan (1957). Aristotle's Syllogistic from the Standpoint of Modern Formal Logic (2 ed.). Oxford University Press. (Reprinted by Garland Publishing in 1987 ISBN 0-8240-6924-2.) <a href="/wiki/Jan_%C5%81ukasiewicz" target="_blank">/wiki/Jan_%C5%81ukasiewicz</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Łukasiewicz, Jan (February 1929). Elementy logiki matematycznej (in Polish) (1 ed.). Warsaw, Poland: Państwowe Wydawnictwo Naukowe; Łukasiewicz, Jan (1963). Elements of mathematical logic. Translated by Wojtasiewicz, Olgierd Adrian [in Polish]. New York, USA: The MacMillan Company. p. 24. <a href="/wiki/Jan_%C5%81ukasiewicz" target="_blank">/wiki/Jan_%C5%81ukasiewicz</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Hamblin, Charles Leonard (1962-11-01). "Translation to and from Polish notation" (PDF). Computer Journal. 5 (3): 210–213. doi:10.1093/comjnl/5.3.210. Archived from the original (PDF) on 2022-10-20. (4 pages) <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Ball, John A. (1978). Algorithms for RPN calculators (1 ed.). Cambridge, Massachusetts, USA: Wiley-Interscience, John Wiley & Sons, Inc. ISBN 0-471-03070-8. LCCN 77-14977. p. 2: […] In their advertisements and also in a letter to me, Hewlett-Packard Company (HP), the best known manufacturer of RPN calculators, says that RPN is based on a suggestion by Jan Łukasiewicz (1878–1956), and that RPN was invented and is patented by HP. Aside from the apparent contradiction in these two statements, I do not think that either of them is quite true. My first experience with RPN involved a nice old Friden EC-130 desktop electronic calculator, circa 1964. The EC-130 has RPN with a push-down stack of four registers, all visible simultaneously on a cathode ray tube display. Furthermore, they are shown upside down, that is, the last-in-first-out register is at the bottom. […] Around 1966, the Monroe Epic calculator offered RPN with a stack of four, a printer, and either 14 or 42 step programmability. The instruction booklets with these two calculators make no mention of RPN or Jan Łukasiewicz. […] <a href="0-471-03070-8" target="_blank">0-471-03070-8</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Kennedy, John (August 1982). "RPN Perspective". PPC Calculator Journal. 9 (5). Mathematics Department, Santa Monica College, Santa Monica, California, USA: 26–29. CiteSeerX 10.1.1.90.6448. Archived from the original on 2022-07-01. Retrieved 2022-07-02. (12 pages) <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.90.6448&rep=rep1&type=pdf" target="_blank">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.90.6448&rep=rep1&type=pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Ceruzzi, Paul E. (April 1980). "1941 RPN Computer?". PPC Calculator Journal. 7 (3): 25. Archived from the original on 2022-07-01. Retrieved 2022-07-01. p. 25: The interesting aspect of the programming of the Z-3 was that this code was very similar to that of, say, an HP-25. To perform an operation on two numbers, commands would first be given to recall the numbers from appropriate locations in the memory, followed by the command for the operation. Numbers were automatically positioned in registers in the Arithmetic Unit of the machine so that operations like division and subtraction would proceed in the right order. Results were left in a register in the AU so that long sequences of operations could be carried out. Thus, the Z-3 used a version of RPN that was nearly identical to that used by HP! I have obtained copies of early programs that Zuse had written for the evaluation of a 5 × 5 determinant, and it is possible to run these programs on an HP-41C with almost no modification whatsoever (once the numbers have been placed in the storage registers beforehand). The AU of the Z-3 contained 3 registers, although Zuse never referred to them as a stack, of course. These registers were labelled "f", "a", and "b". All entrance and exit to and from the AU was through the "f" register. This is sort of like the display register of the 41C, which is distinct from the stack. Arithmetic operations were performed on numbers in the a and b registers, so these may be thought of as corresponding to the x and y registers of HP's. Unlike modern computer practice, the actual numbers themselves were moved around the registers, not just a pointer. <a href="/wiki/Paul_E._Ceruzzi" target="_blank">/wiki/Paul_E._Ceruzzi</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Rojas, Raúl (April–June 1997). "Konrad Zuse's Legacy: The Architecture of the Z1 and Z3" (PDF). IEEE Annals of the History of Computing. 19 (2): 5–16 [7–8]. doi:10.1109/85.586067. Archived (PDF) from the original on 2022-07-03. Retrieved 2022-07-03. (12 pages) <a href="/wiki/Ra%C3%BAl_Rojas" target="_blank">/wiki/Ra%C3%BAl_Rojas</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Burks, Arthur Walter; Warren, Don W.; Wright, Jesse B. (1954). "An Analysis of a Logical Machine Using Parenthesis-Free Notation". Mathematical Tables and Other Aids to Computation. 8 (46): 53–57. doi:10.2307/2001990. JSTOR 2001990. <a href="/wiki/Arthur_Walter_Burks" target="_blank">/wiki/Arthur_Walter_Burks</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Hamblin, Charles Leonard (May 1957). An Addressless Coding Scheme based on Mathematical Notation (Typescript). New South Wales University of Technology. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Hamblin, Charles Leonard (June 1957). "An addressless coding scheme based on mathematical notation". Proceedings of the First Australian Conference on Computing and Data Processing. Salisbury, South Australia: Weapons Research Establishment. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Hamblin, Charles Leonard (1957). "Computer Languages". The Australian Journal of Science (20?): 135–139; Hamblin, Charles Leonard (November 1985). "Computer Languages". The Australian Computer Journal (Reprint). 17 (4): 195–198. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Hamblin, Charles Leonard (1958). GEORGE IA and II: A semi-translation programming scheme for DEUCE: Programming and Operation Manual (PDF). School of Humanities, University of New South Wales, Kensington, New South Wales. Archived (PDF) from the original on 2020-04-04. Retrieved 2020-07-27. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">McBurney, Peter (2008-12-06). "Charles L. Hamblin and his work". Archived from the original on 2008-12-06. <a href="https://web.archive.org/web/20081206093044/http://www.csc.liv.ac.uk/~peter/hamblin.html" target="_blank">https://web.archive.org/web/20081206093044/http://www.csc.liv.ac.uk/~peter/hamblin.html</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">McBurney, Peter (2008-07-27). "Charles L. Hamblin: Computer Pioneer". Archived from the original on 2008-12-07. […] Hamblin soon became aware of the problems of (a) computing mathematical formulae containing brackets, and (b) the memory overhead in having dealing with memory stores each of which had its own name. One solution to the first problem was Jan Łukasiewicz's Polish notation, which enables a writer of mathematical notation to instruct a reader the order in which to execute the operations (e.g. addition, multiplication, etc) without using brackets. Polish notation achieves this by having an operator (+, ×, etc) precede the operands to which it applies, e.g., +ab, instead of the usual, a+b. Hamblin, with his training in formal logic, knew of Lukasiewicz's work. […] <a href="https://web.archive.org/web/20081207005233/http://www.csc.liv.ac.uk/~peter/this-month/this-month-3-030303.html" target="_blank">https://web.archive.org/web/20081207005233/http://www.csc.liv.ac.uk/~peter/this-month/this-month-3-030303.html</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Osborne, Thomas E. (2010) [1994]. "Tom Osborne's Story in His Own Words". Steve Leibson. Archived from the original on 2022-04-04. Retrieved 2016-01-01. […] I changed the architecture to use RPN (Reverse Polish Notation), which is the ideal notation for programming environment in which coding efficiency is critical. In the beginning, that change was not well received... […] <a href="/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1" target="_blank">/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Peterson, Kristina (2011-05-04). "Wall Street's Cult Calculator Turns 30". The Wall Street Journal. Archived from the original on 2015-03-16. Retrieved 2015-12-06. <a href="https://web.archive.org/web/20150316030830/https://www.wsj.com/articles/SB10001424052748703841904576257440326458056" target="_blank">https://web.archive.org/web/20150316030830/https://www.wsj.com/articles/SB10001424052748703841904576257440326458056</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Williams, Al (2023-06-21). "In Praise Of RPN (with Python Or C)". Hackaday. Archived from the original on 2023-09-23. Retrieved 2023-09-23. <a href="https://hackaday.com/2023/06/21/in-praise-of-rpn-with-python-or-c/" target="_blank">https://hackaday.com/2023/06/21/in-praise-of-rpn-with-python-or-c/</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Kasprzyk, Dennis Michael; Drury, Colin G.; Bialas, Wayne F. (1979) [1978-09-25]. "Human behaviour and performance in calculator use with Algebraic and Reverse Polish Notation". Ergonomics. 22 (9). Department of Industrial Engineering, State University of New York at Buffalo, Amherst, New York, USA: Taylor & Francis: 1011–1019. doi:10.1080/00140137908924675. eISSN 1366-5847. ISSN 0014-0139. S2CID 62692402. (9 pages) <a href="/wiki/Ergonomics_(journal)" target="_blank">/wiki/Ergonomics_(journal)</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">Agate, Seb J.; Drury, Colin G. (March 1980). "Electronic calculators: which notation is the better?" (PDF). Applied Ergonomics. 11 (1). Department of Industrial Engineering, University at Buffalo, State University of New York, USA: IPC Business Press: 2–6. doi:10.1016/0003-6870(80)90114-3. eISSN 1872-9126. ISSN 0003-6870. PMID 15676368. 0003-6870/80/01 0002-05. Archived (PDF) from the original on 2023-09-23. Retrieved 2018-09-22. p. 6: In terms of practical choice between calculators, it would appear that RPN is faster and more accurate overall but particularly for more complex problems. (5 pages) <a href="https://www.keesvandersanden.nl/calculators/downloads/Electronic-calculators-which-notation-is-the-better.pdf" target="_blank">https://www.keesvandersanden.nl/calculators/downloads/Electronic-calculators-which-notation-is-the-better.pdf</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Hoffman, Errol; Ma, Patrick; See, Jason; Yong, Chee Kee; Brand, Jason; Poulton, Matthew (1994). "Calculator logic: when and why is RPN superior to algebraic?". Applied Ergonomics. 25 (5). Elsevier Science Ltd.: 327–333. doi:10.1016/0003-6870(94)90048-5. eISSN 1872-9126. ISSN 0003-6870. <a href="/wiki/Applied_Ergonomics" target="_blank">/wiki/Applied_Ergonomics</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Agate, Seb J.; Drury, Colin G. (March 1980). "Electronic calculators: which notation is the better?" (PDF). Applied Ergonomics. 11 (1). Department of Industrial Engineering, University at Buffalo, State University of New York, USA: IPC Business Press: 2–6. doi:10.1016/0003-6870(80)90114-3. eISSN 1872-9126. ISSN 0003-6870. PMID 15676368. 0003-6870/80/01 0002-05. Archived (PDF) from the original on 2023-09-23. Retrieved 2018-09-22. p. 6: In terms of practical choice between calculators, it would appear that RPN is faster and more accurate overall but particularly for more complex problems. (5 pages) <a href="https://www.keesvandersanden.nl/calculators/downloads/Electronic-calculators-which-notation-is-the-better.pdf" target="_blank">https://www.keesvandersanden.nl/calculators/downloads/Electronic-calculators-which-notation-is-the-better.pdf</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">"Rechenhilfe für Ingenieure". Alumni-Magazin der Technischen Universität Berlin (in German). Vol. 2, no. 3. Technische Universität Berlin. December 2000. Archived from the original on 2009-02-13. <a href="https://web.archive.org/web/20090213222711/http://www2.tu-berlin.de/alumni/parTU/00dez/zuse.htm" target="_blank">https://web.archive.org/web/20090213222711/http://www2.tu-berlin.de/alumni/parTU/00dez/zuse.htm</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Zuse, Horst, ed. (2008-02-22). "Z3 im Detail" [Z3 in details]. Professor Dr.-Ing. habil. Horst Zuse (in German). Archived from the original on 2022-07-01. Retrieved 2022-07-01. Die Z3 konnte in zwei Betriebsmodi betrieben werden, und zwar in dem Programm- und Dialogmodus. Das Rechnen im Dialog erfolgt wie mit einem Taschenrechner in der umgekehrten polnischen Notation. [1] <a href="/wiki/Horst_Zuse" target="_blank">/wiki/Horst_Zuse</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">"An einem 12. Mai" (in German). Deutsches Historisches Museum (German Historical Museum). Archived from the original on 2013-05-30. <a href="https://web.archive.org/web/20130530040033/http://www.dhm.de/gaeste/luise/tagesfakten/tf05/0512.htm" target="_blank">https://web.archive.org/web/20130530040033/http://www.dhm.de/gaeste/luise/tagesfakten/tf05/0512.htm</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Bundesmann, Jan (June 2016). "Zum 75. Geburtstag von Konrad Zuses Z3: Ratterkasten". Report / Jubiläum. iX (in German). Vol. 2016, no. 6. Heise Verlag. p. 94. Archived from the original on 2022-07-01. Retrieved 2022-07-01. p. 94: Zum Eingeben der Zahlen stand eine Tastatur bereit (Dezimalzahlen, Gleitkommadarstellung). Anweisungen gaben Nutzer in umgekehrter polnischer Notation: zuerst die Argumente, um Register zu befüllen, dann der auszuführende Operator. <a href="https://www.heise.de/select/ix/2016/6/1464579381888967#literaturverzeichnis" target="_blank">https://www.heise.de/select/ix/2016/6/1464579381888967#literaturverzeichnis</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">In reference to "In dialog mode, it allowed operators to enter two operands followed by the desired operation" for the Z3 computer, the following citations are relevant :[7][26][8][27][23][28][25][29][30] <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Zuse, Horst, ed. (2008-02-22). "Z3 im Detail" [Z3 in details]. Professor Dr.-Ing. habil. Horst Zuse (in German). Archived from the original on 2022-07-01. Retrieved 2022-07-01. Die Z3 konnte in zwei Betriebsmodi betrieben werden, und zwar in dem Programm- und Dialogmodus. Das Rechnen im Dialog erfolgt wie mit einem Taschenrechner in der umgekehrten polnischen Notation. [1] <a href="/wiki/Horst_Zuse" target="_blank">/wiki/Horst_Zuse</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">Zuse, Horst, ed. (2008-02-22). "Z3 im Detail" [Z3 in details]. Professor Dr.-Ing. habil. Horst Zuse (in German). Archived from the original on 2022-07-01. Retrieved 2022-07-01. Die Z3 konnte in zwei Betriebsmodi betrieben werden, und zwar in dem Programm- und Dialogmodus. Das Rechnen im Dialog erfolgt wie mit einem Taschenrechner in der umgekehrten polnischen Notation. [1] <a href="/wiki/Horst_Zuse" target="_blank">/wiki/Horst_Zuse</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">Blaauw, Gerrit Anne; Brooks, Jr., Frederick Phillips (1997). Computer architecture: Concepts and evolution. Boston, Massachusetts, USA: Addison-Wesley Longman Publishing Co., Inc. <a href="/wiki/Gerrit_Anne_Blaauw" target="_blank">/wiki/Gerrit_Anne_Blaauw</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">LaForest, Charles Eric (April 2007). "2.1 Lukasiewicz and the First Generation: 2.1.2 Germany: Konrad Zuse (1910–1995); 2.2 The First Generation of Stack Computers: 2.2.1 Zuse Z4". Second-Generation Stack Computer Architecture (PDF) (thesis). Waterloo, Canada: University of Waterloo. pp. 8, 11. Archived (PDF) from the original on 2022-01-20. Retrieved 2022-07-02. (178 pages) <a href="http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf" target="_blank">http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">Beard, Bob (Autumn 1997) [1996-10-01]. "The KDF9 Computer — 30 Years On" (PDF). Resurrection - The Bulletin of the Computer Conservation Society. No. 18. Computer Conservation Society (CCS). pp. 7–15. ISSN 0958-7403. Archived (PDF) from the original on 2020-07-27. Retrieved 2020-07-27. p. 8: […] The KDF9 is remarkable because it is the believed to be the first zero-address instruction format computer to have been announced (in 1960). It was first delivered at about the same time (early 1963) as the other famous zero-address computer, the Burroughs B5000 in America. Like many modern pocket calculators, a zero-address machine allows the use of Reverse Polish arithmetic; this offers certain advantages to compiler writers. It is believed that the attention of the English Electric team was first drawn to the zero-address concept through contact with George (General Order Generator), an autocode programming system written for a Deuce computer by the University of Sydney, Australia, in the latter half of the 1950s. George used Reversed Polish, and the KDF9 team were attracted to this convention for the pragmatic reason of wishing to enhance performance by minimising accesses to main store. This may be contrasted with the more "theoretical" line taken independently by Burroughs. Besides a hardware nesting store or stack - the basic mechanism of a zero-address computer - the KDF9 had other groups of central registers for improving performance which gave it an interesting internal structure. […] [2] (NB. This is an edited version of a talk given to North West Group of the Society at the Museum of Science and Industry, Manchester, UK on 1996-10-01.) <a href="http://www.cs.man.ac.uk/CCS/Archive/Resurrection/pdf/res18.pdf" target="_blank">http://www.cs.man.ac.uk/CCS/Archive/Resurrection/pdf/res18.pdf</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">Hamblin, Charles Leonard (May 1957). An Addressless Coding Scheme based on Mathematical Notation (Typescript). New South Wales University of Technology. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">Hamblin, Charles Leonard (June 1957). "An addressless coding scheme based on mathematical notation". Proceedings of the First Australian Conference on Computing and Data Processing. Salisbury, South Australia: Weapons Research Establishment. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">Hamblin, Charles Leonard (1958). GEORGE IA and II: A semi-translation programming scheme for DEUCE: Programming and Operation Manual (PDF). School of Humanities, University of New South Wales, Kensington, New South Wales. Archived (PDF) from the original on 2020-04-04. Retrieved 2020-07-27. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
<li id="fn:36">Duncan, Fraser George (1977-05-01). "Stack Machine Development: Australia, Great Britain, and Europe" (PDF). Computer. Vol. 10, no. 5. University of Bristol, Bristol, Virginia, USA. pp. 50–52. doi:10.1109/MC.1977.315873. eISSN 1558-0814. ISSN 0018-9162. S2CID 17013010. CODEN CPTRB4. Archived from the original (PDF) on 2023-10-15. Retrieved 2023-10-15. (3 pages) <a href="https://web.archive.org/web/20231015112418/https://csdl-downloads.ieeecomputer.org/mags/co/1977/05/01646485.pdf?Expires=1697369097&Policy=eyJTdGF0ZW1lbnQiOlt7IlJlc291cmNlIjoiaHR0cHM6Ly9jc2RsLWRvd25sb2Fkcy5pZWVlY29tcHV0ZXIub3JnL21hZ3MvY28vMTk3Ny8wNS8wMTY0NjQ4NS5wZGYiLCJDb25kaXRpb24iOnsiRGF0ZUxlc3NUaGFuIjp7IkFXUzpFcG9jaFRpbWUiOjE2OTczNjkwOTd9fX1dfQ__&Signature=xUP0yvim4Anf0nWqRYKhw7EINRBgqttNgyV0fOBmg4jGQU~Uo1eP91Mw2CL34gK18qbzYjWRKwqifo7aVUL2hgxz~ZplAiqNXRqbLpbB4bYfoPiJNJ3x0AJmfERxcIG058YoTI8~uiEhmUNgjJkrfSMbqHwUoqit~4p7xFLfFBqiPau56WqdEngihf8OXuDeUxkMvCPgo2tGnN5GCoGY9-ALYc99IxqY8-ltGpsyauyASyerp42tY7E6r7T~6x75q8mjilSfo~tTpJMTdX2DpGepaobjf9D7MAXWv7iko038yLn8Kp8WxQceX6VX8fM85pPPYapXGK4HrPNnUIGeiw__&Key-Pair-Id=K12PMWTCQBDMDT" target="_blank">https://web.archive.org/web/20231015112418/https://csdl-downloads.ieeecomputer.org/mags/co/1977/05/01646485.pdf?Expires=1697369097&Policy=eyJTdGF0ZW1lbnQiOlt7IlJlc291cmNlIjoiaHR0cHM6Ly9jc2RsLWRvd25sb2Fkcy5pZWVlY29tcHV0ZXIub3JnL21hZ3MvY28vMTk3Ny8wNS8wMTY0NjQ4NS5wZGYiLCJDb25kaXRpb24iOnsiRGF0ZUxlc3NUaGFuIjp7IkFXUzpFcG9jaFRpbWUiOjE2OTczNjkwOTd9fX1dfQ__&Signature=xUP0yvim4Anf0nWqRYKhw7EINRBgqttNgyV0fOBmg4jGQU~Uo1eP91Mw2CL34gK18qbzYjWRKwqifo7aVUL2hgxz~ZplAiqNXRqbLpbB4bYfoPiJNJ3x0AJmfERxcIG058YoTI8~uiEhmUNgjJkrfSMbqHwUoqit~4p7xFLfFBqiPau56WqdEngihf8OXuDeUxkMvCPgo2tGnN5GCoGY9-ALYc99IxqY8-ltGpsyauyASyerp42tY7E6r7T~6x75q8mjilSfo~tTpJMTdX2DpGepaobjf9D7MAXWv7iko038yLn8Kp8WxQceX6VX8fM85pPPYapXGK4HrPNnUIGeiw__&Key-Pair-Id=K12PMWTCQBDMDT</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></li>
<li id="fn:37">Allen, Murray W. (1985-11-01). "Charles Hamblin (1922–1985)". Australian Computer Journal. 17 (4). Darlinghurst, Australia: Australian Computer Society, Inc.: 194–195. ISSN 0004-8917. Retrieved 2023-10-15. (2 pages) <a href="https://dl.acm.org/doi/10.5555/7385.7391" target="_blank">https://dl.acm.org/doi/10.5555/7385.7391</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></li>
<li id="fn:38">LaForest, Charles Eric (April 2007). "2.1 Lukasiewicz and the First Generation: 2.1.2 Germany: Konrad Zuse (1910–1995); 2.2 The First Generation of Stack Computers: 2.2.1 Zuse Z4". Second-Generation Stack Computer Architecture (PDF) (thesis). Waterloo, Canada: University of Waterloo. pp. 8, 11. Archived (PDF) from the original on 2022-01-20. Retrieved 2022-07-02. (178 pages) <a href="http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf" target="_blank">http://fpgacpu.ca/publications/Second-Generation_Stack_Computer_Architecture.pdf</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></li>
<li id="fn:39">Hamblin, Charles Leonard (May 1957). An Addressless Coding Scheme based on Mathematical Notation (Typescript). New South Wales University of Technology. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></li>
<li id="fn:40">Hamblin, Charles Leonard (June 1957). "An addressless coding scheme based on mathematical notation". Proceedings of the First Australian Conference on Computing and Data Processing. Salisbury, South Australia: Weapons Research Establishment. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></li>
<li id="fn:41">Hamblin, Charles Leonard (1958). GEORGE IA and II: A semi-translation programming scheme for DEUCE: Programming and Operation Manual (PDF). School of Humanities, University of New South Wales, Kensington, New South Wales. Archived (PDF) from the original on 2020-04-04. Retrieved 2020-07-27. <a href="/wiki/Charles_Leonard_Hamblin" target="_blank">/wiki/Charles_Leonard_Hamblin</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></li>
<li id="fn:42">Beard, Bob (Autumn 1997) [1996-10-01]. "The KDF9 Computer — 30 Years On" (PDF). Resurrection - The Bulletin of the Computer Conservation Society. No. 18. Computer Conservation Society (CCS). pp. 7–15. ISSN 0958-7403. Archived (PDF) from the original on 2020-07-27. Retrieved 2020-07-27. p. 8: […] The KDF9 is remarkable because it is the believed to be the first zero-address instruction format computer to have been announced (in 1960). It was first delivered at about the same time (early 1963) as the other famous zero-address computer, the Burroughs B5000 in America. Like many modern pocket calculators, a zero-address machine allows the use of Reverse Polish arithmetic; this offers certain advantages to compiler writers. It is believed that the attention of the English Electric team was first drawn to the zero-address concept through contact with George (General Order Generator), an autocode programming system written for a Deuce computer by the University of Sydney, Australia, in the latter half of the 1950s. George used Reversed Polish, and the KDF9 team were attracted to this convention for the pragmatic reason of wishing to enhance performance by minimising accesses to main store. This may be contrasted with the more "theoretical" line taken independently by Burroughs. Besides a hardware nesting store or stack - the basic mechanism of a zero-address computer - the KDF9 had other groups of central registers for improving performance which gave it an interesting internal structure. […] [2] (NB. This is an edited version of a talk given to North West Group of the Society at the Museum of Science and Industry, Manchester, UK on 1996-10-01.) <a href="http://www.cs.man.ac.uk/CCS/Archive/Resurrection/pdf/res18.pdf" target="_blank">http://www.cs.man.ac.uk/CCS/Archive/Resurrection/pdf/res18.pdf</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></li>
<li id="fn:43">Galler, Bernard A.; Rosin, Robert F., eds. (1986) [1985-09-06]. The Burroughs B 5000 Conference - OH 98 (PDF). Marina Del Ray Hotel, Marina Del Ray, California, USA: Charles Babbage Institute, The Center for the History of Information Processing, University of Minnesota, Minneapolis, USA. Archived from the original (PDF) on 2012-04-22. Retrieved 2013-02-27. A New Approach to the Design of a Digital Computer (1961) <a href="https://web.archive.org/web/20120422070048/http://conservancy.umn.edu/bitstream/107105/1/oh098b5c.pdf" target="_blank">https://web.archive.org/web/20120422070048/http://conservancy.umn.edu/bitstream/107105/1/oh098b5c.pdf</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></li>
<li id="fn:44">"The Burroughs B5000 Conference (1985)". 2023-06-17. p. 49. <a href="http://special.lib.umn.edu/cbi/oh/pdf.phtml?id=21" target="_blank">http://special.lib.umn.edu/cbi/oh/pdf.phtml?id=21</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></li>
<li id="fn:45">Galler, Bernard A.; Rosin, Robert F., eds. (1985-09-06). "Oral History: Burroughs B5000 Conference" (PDF). Marina del Rey, California, USA, archived by the Charles Babbage Institute, University of Minnesota, Minneapolis: AFIPS / Burroughs Corporation. hdl:11299/107105. OH 98. Archived (PDF) from the original on 2023-09-23. Retrieved 2023-09-23. <a href="https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y" target="_blank">https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></li>
<li id="fn:46">Galler, Bernard A.; Rosin, Robert F., eds. (1985-09-06). "Oral History: Burroughs B5000 Conference" (PDF). Marina del Rey, California, USA, archived by the Charles Babbage Institute, University of Minnesota, Minneapolis: AFIPS / Burroughs Corporation. hdl:11299/107105. OH 98. Archived (PDF) from the original on 2023-09-23. Retrieved 2023-09-23. <a href="https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y" target="_blank">https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></li>
<li id="fn:47">Galler, Bernard A.; Rosin, Robert F., eds. (1985-09-06). "Oral History: Burroughs B5000 Conference" (PDF). Marina del Rey, California, USA, archived by the Charles Babbage Institute, University of Minnesota, Minneapolis: AFIPS / Burroughs Corporation. hdl:11299/107105. OH 98. Archived (PDF) from the original on 2023-09-23. Retrieved 2023-09-23. <a href="https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y" target="_blank">https://conservancy.umn.edu/bitstream/handle/11299/107105/oh098b5c.pdf?sequence=1&isAllowed=y</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></li>
<li id="fn:48">"1928–2012 Obituary Condolences Robert (Bob) Ragen". Legacy.com. 2012-07-23. Archived from the original on 2017-12-18. Retrieved 2016-01-01. […] Bob holds over 80 patents awarded during his work as Director of RD for Friden, and Singer and as Senior Project Engineer at Xerox. He retired from Xerox RD in 1990. He is responsible for the development of the first commercial electronic calculator, the Friden 130, which has been displayed at the Smithsonian. […] <a href="http://www.legacy.com/obituaries/insidebayarea/obituary.aspx?n=robert-ragen-bob&pid=158717663" target="_blank">http://www.legacy.com/obituaries/insidebayarea/obituary.aspx?n=robert-ragen-bob&pid=158717663</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></li>
<li id="fn:49">Ball, John A. (1978). Algorithms for RPN calculators (1 ed.). Cambridge, Massachusetts, USA: Wiley-Interscience, John Wiley & Sons, Inc. ISBN 0-471-03070-8. LCCN 77-14977. p. 2: […] In their advertisements and also in a letter to me, Hewlett-Packard Company (HP), the best known manufacturer of RPN calculators, says that RPN is based on a suggestion by Jan Łukasiewicz (1878–1956), and that RPN was invented and is patented by HP. Aside from the apparent contradiction in these two statements, I do not think that either of them is quite true. My first experience with RPN involved a nice old Friden EC-130 desktop electronic calculator, circa 1964. The EC-130 has RPN with a push-down stack of four registers, all visible simultaneously on a cathode ray tube display. Furthermore, they are shown upside down, that is, the last-in-first-out register is at the bottom. […] Around 1966, the Monroe Epic calculator offered RPN with a stack of four, a printer, and either 14 or 42 step programmability. The instruction booklets with these two calculators make no mention of RPN or Jan Łukasiewicz. […] <a href="0-471-03070-8" target="_blank">0-471-03070-8</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></li>
<li id="fn:50">"Friden EC-130 Electronic Calculator". www.oldcalculatormuseum.com. 2020-08-09. Archived from the original on 2022-10-20. Retrieved 2018-03-21. <a href="http://www.oldcalculatormuseum.com/friden130.html" target="_blank">http://www.oldcalculatormuseum.com/friden130.html</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></li>
<li id="fn:51">"Friden EC-132 Electronic Calculator". www.oldcalculatormuseum.com. 2022-07-15. Archived from the original on 2022-10-20. Retrieved 2018-03-21. <a href="http://www.oldcalculatormuseum.com/friden132.html" target="_blank">http://www.oldcalculatormuseum.com/friden132.html</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></li>
<li id="fn:52">Ball, John A. (1978). Algorithms for RPN calculators (1 ed.). Cambridge, Massachusetts, USA: Wiley-Interscience, John Wiley & Sons, Inc. ISBN 0-471-03070-8. LCCN 77-14977. p. 2: […] In their advertisements and also in a letter to me, Hewlett-Packard Company (HP), the best known manufacturer of RPN calculators, says that RPN is based on a suggestion by Jan Łukasiewicz (1878–1956), and that RPN was invented and is patented by HP. Aside from the apparent contradiction in these two statements, I do not think that either of them is quite true. My first experience with RPN involved a nice old Friden EC-130 desktop electronic calculator, circa 1964. The EC-130 has RPN with a push-down stack of four registers, all visible simultaneously on a cathode ray tube display. Furthermore, they are shown upside down, that is, the last-in-first-out register is at the bottom. […] Around 1966, the Monroe Epic calculator offered RPN with a stack of four, a printer, and either 14 or 42 step programmability. The instruction booklets with these two calculators make no mention of RPN or Jan Łukasiewicz. […] <a href="0-471-03070-8" target="_blank">0-471-03070-8</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></li>
<li id="fn:53">Osborne, Thomas E. (2010) [1994]. "Tom Osborne's Story in His Own Words". Steve Leibson. Archived from the original on 2022-04-04. Retrieved 2016-01-01. […] I changed the architecture to use RPN (Reverse Polish Notation), which is the ideal notation for programming environment in which coding efficiency is critical. In the beginning, that change was not well received... […] <a href="/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1" target="_blank">/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></li>
<li id="fn:54">Monnier, Richard E. (September 1968). "A New Electronic Calculator with Computerlike Capabilities" (PDF). Hewlett-Packard Journal. 20 (1). Palo Alto, California, USA: Hewlett-Packard: 3–9. Archived (PDF) from the original on 2022-10-20. Retrieved 2016-01-03. <a href="http://www.hparchive.com/Journals/HPJ-1968-09.pdf" target="_blank">http://www.hparchive.com/Journals/HPJ-1968-09.pdf</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></li>
<li id="fn:55">"hp 9100A Calculator" (PDF) (marketing brochure). Hewlett-Packard. 1968. pp. 8–10. Archived (PDF) from the original on 2021-10-22. Retrieved 2013-01-26. <a href="http://archive.computerhistory.org/resources/text/HP/HP.9100A.1968.102646164.pdf" target="_blank">http://archive.computerhistory.org/resources/text/HP/HP.9100A.1968.102646164.pdf</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></li>
<li id="fn:56">"HP 9100A/B". MoHPC - The Museum of HP Calculators. 1998. Archived from the original on 2023-09-23. Retrieved 2023-09-23. <a href="https://www.hpmuseum.org/hp9100.htm" target="_blank">https://www.hpmuseum.org/hp9100.htm</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></li>
<li id="fn:57">Osborne, Thomas E. (2010) [1994]. "Tom Osborne's Story in His Own Words". Steve Leibson. Archived from the original on 2022-04-04. Retrieved 2016-01-01. […] I changed the architecture to use RPN (Reverse Polish Notation), which is the ideal notation for programming environment in which coding efficiency is critical. In the beginning, that change was not well received... […] <a href="/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1" target="_blank">/w/index.php?title=Tom_Osborne_(engineer)&action=edit&redlink=1</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></li>
<li id="fn:58">HP35 User's Manual. Hewlett-Packard. p. i. p. i: […] The operational stack and reverse Polish (Łukasiewicz) notation used in the HP-35 are the most efficient way known to computer science for evaluating mathematical expressions. […] <a href="/wiki/Hewlett-Packard" target="_blank">/wiki/Hewlett-Packard</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></li>
<li id="fn:59">Hewlett-Packard, in the 1970s, called their special RPN stack implementation an operational (memory) stack or automatic memory stack. Interestingly, Klaus Samelson and Friedrich L. Bauer, the inventors of the stack principle, called their stack Operationskeller (Engl. "operational cellar") in 1955, and parallel discoverer Wilhelm Kämmerer [de] called his stack concept Automatisches Gedächtnis (Engl. "automatic memory") in 1958. <a href="/wiki/Hewlett-Packard" target="_blank">/wiki/Hewlett-Packard</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></li>
<li id="fn:60">HP-42S RPN Scientific Calculator – Owner's Manual (PDF) (1 ed.). Corvallis, Oregon, USA: Hewlett-Packard Co. June 1988. p. 3. 00042-90001. Archived (PDF) from the original on 2017-09-17. Retrieved 2017-09-17. <a href="http://www.hp41.net/forum/fileshp41net/manuel-hp42s-us.pdf" target="_blank">http://www.hp41.net/forum/fileshp41net/manuel-hp42s-us.pdf</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></li>
<li id="fn:61">"Section 3: The Automatic Memory Stack, LAST X, and Data Storage". Hewlett-Packard HP-15C Owner's Handbook (PDF). 2.4. Hewlett-Packard Development Company, LP. September 2011. pp. 32–46. 00015-90001. Archived (PDF) from the original on 2017-09-17. Retrieved 2015-12-05. <a href="http://www.hp.com/ctg/Manual/c03030589.pdf" target="_blank">http://www.hp.com/ctg/Manual/c03030589.pdf</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></li>
<li id="fn:62">Hewlett-Packard, in the 1970s, called their special RPN stack implementation an operational (memory) stack or automatic memory stack. Interestingly, Klaus Samelson and Friedrich L. Bauer, the inventors of the stack principle, called their stack Operationskeller (Engl. "operational cellar") in 1955, and parallel discoverer Wilhelm Kämmerer [de] called his stack concept Automatisches Gedächtnis (Engl. "automatic memory") in 1958. <a href="/wiki/Hewlett-Packard" target="_blank">/wiki/Hewlett-Packard</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></li>
<li id="fn:63">Laporte, Jacques (2014-05-22). "The slide rule killer: a milestone in computer history". Archived from the original on 2015-02-11. Retrieved 2016-01-01. <a href="https://web.archive.org/web/20150211194800/http://jacques-laporte.org/HP%2035%20Saga.htm" target="_blank">https://web.archive.org/web/20150211194800/http://jacques-laporte.org/HP%2035%20Saga.htm</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></li>
<li id="fn:64">"Section 3: The Automatic Memory Stack, LAST X, and Data Storage". Hewlett-Packard HP-15C Owner's Handbook (PDF). 2.4. Hewlett-Packard Development Company, LP. September 2011. pp. 32–46. 00015-90001. Archived (PDF) from the original on 2017-09-17. Retrieved 2015-12-05. <a href="http://www.hp.com/ctg/Manual/c03030589.pdf" target="_blank">http://www.hp.com/ctg/Manual/c03030589.pdf</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></li>
<li id="fn:65">Wickes, William C. (January–February 1987). "The HP-28C: An Insider's Perspective". HPX Exchange. 1 (1). [3] <a href="https://web.archive.org/web/20231006184209/https://www.hpmuseum.org/forum/thread-1140.html" target="_blank">https://web.archive.org/web/20231006184209/https://www.hpmuseum.org/forum/thread-1140.html</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></li>
<li id="fn:66">Hewlett-Packard. "RPLMan from Goodies Disk 4" (RPLMAN.ZIP). Retrieved 2015-09-12. <a href="/wiki/Hewlett-Packard" target="_blank">/wiki/Hewlett-Packard</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></li>
<li id="fn:67">Wessman, Timothy "Tim" James (2016-06-21) [2016-06-20]. "What to do with stack overflow OBJ->/LIST->?". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24. <a href="https://www.hpmuseum.org/forum/printthread.php?tid=6436" target="_blank">https://www.hpmuseum.org/forum/printthread.php?tid=6436</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></li>
<li id="fn:68">"HP Calculators". <a href="http://www8.hp.com/us/en/products/calculators/index.html" target="_blank">http://www8.hp.com/us/en/products/calculators/index.html</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></li>
<li id="fn:69">Nelson, Richard J. (April 2012). "HP RPN Evolves" (PDF). HP Solve (27). Hewlett-Packard Development Company, L.P.: 42–45. Archived (PDF) from the original on 2022-10-20. Retrieved 2022-10-20. [4] (4 of 56 pages) <a href="http://h20331.www2.hp.com/hpsub/downloads/S07%20HP%20RPN%20Evolves%20V5b.pdf" target="_blank">http://h20331.www2.hp.com/hpsub/downloads/S07%20HP%20RPN%20Evolves%20V5b.pdf</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></li>
<li id="fn:70">Wessman, Timothy "Tim" James (2016-06-21) [2016-06-20]. "What to do with stack overflow OBJ->/LIST->?". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24. <a href="https://www.hpmuseum.org/forum/printthread.php?tid=6436" target="_blank">https://www.hpmuseum.org/forum/printthread.php?tid=6436</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></li>
<li id="fn:71">Shirriff, Ken. "Reversing Sinclair's amazing 1974 calculator hack – half the ROM of the HP-35". Archived from the original on 2022-08-26. Retrieved 2013-12-09. <a href="http://files.righto.com/calculator/sinclair_scientific_simulator.html" target="_blank">http://files.righto.com/calculator/sinclair_scientific_simulator.html</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></li>
<li id="fn:72">Sharwood, Simon (2013-09-02). "Google chap reverse engineers Sinclair Scientific Calculator". The Register. Archived from the original on 2022-10-20. Retrieved 2013-12-09. <a href="https://www.theregister.co.uk/2013/09/02/google_chap_reverse_engineers_sinclair_scientific_calculator/" target="_blank">https://www.theregister.co.uk/2013/09/02/google_chap_reverse_engineers_sinclair_scientific_calculator/</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></li>
<li id="fn:73">SR4921 RPN Reverse Notation Scientific Calculator Instruction Manual (PDF). Palo Alto, California, USA: Commodore Business Machines, Inc. Archived (PDF) from the original on 2017-06-25. Retrieved 2022-10-16. <a href="http://www.wass.net/manuals/Commodore%20SR4921R.pdf" target="_blank">http://www.wass.net/manuals/Commodore%20SR4921R.pdf</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></li>
<li id="fn:74">"Prinztronic Program". www.vintagecalculators.com. Retrieved 2018-03-21. <a href="http://www.vintagecalculators.com/html/program.html" target="_blank">http://www.vintagecalculators.com/html/program.html</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></li>
<li id="fn:75">Elektronika B3-21 page on RSkey.org <a href="http://www.rskey.org/detail.asp?manufacturer=Elektronika&model=B3-21" target="_blank">http://www.rskey.org/detail.asp?manufacturer=Elektronika&model=B3-21</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></li>
<li id="fn:76">Elektronika MK-161 page on RSkey.org <a href="http://www.rskey.org/detail.asp?manufacturer=Elektronika&model=MK-161" target="_blank">http://www.rskey.org/detail.asp?manufacturer=Elektronika&model=MK-161</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></li>
<li id="fn:77">"Elektronika MK-61/52 and 152/161: small tech review (En) - Кон-Тики". arbinada.com. Retrieved 2018-03-21. <a href="http://arbinada.com/pmk/node/56" target="_blank">http://arbinada.com/pmk/node/56</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></li>
<li id="fn:78">"НПП СЕМИКО - вычислительная техника и устройства автоматизации". mk.semico.ru. Retrieved 2018-03-21. <a href="http://mk.semico.ru/" target="_blank">http://mk.semico.ru/</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></li>
<li id="fn:79">"A new standard!... The 7400 scientific & engineering calculator" (PDF). Radio-Electronics - For men with ideas in electronics (Advertisement). Vol. 43, no. 12. New York, USA: Gernsback Publications, Inc. December 1972. p. 17. Archived (PDF) from the original on 2022-12-28. Retrieved 2022-12-28. p. 17: DATA STORAGE: 2 Auxiliary Storage Registers plus up to 7 push-up Stack Registers. […] 7400A 3 Registers Kit $299.95 Assembled $379.95 […] 7400B 5 Registers Kit $319.95 Assembled $399.95 […] 7400C 7 Registers Kit $339.95 Assembled $419.95 <a href="https://worldradiohistory.com/Archive-Radio-Electronics/70s/1972/Radio-Electronics-1972-12.pdf" target="_blank">https://worldradiohistory.com/Archive-Radio-Electronics/70s/1972/Radio-Electronics-1972-12.pdf</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></li>
<li id="fn:80">Berger, Ivan (May 1973). "New calculator kits: From pocket minis to versatile desk models". Popular Mechanics. Hearst Magazines: 152. Retrieved 2017-04-29. <a href="https://books.google.com/books?id=htQDAAAAMBAJ&pg=PA151" target="_blank">https://books.google.com/books?id=htQDAAAAMBAJ&pg=PA151</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></li>
<li id="fn:81">"MITS 7400 Scientific/Engineering Calculator". Archived from the original on 2017-04-30. Retrieved 2017-04-30. (NB. Shows a photo of the MITS 7400, but the text erroneously refers to the later algebraic 7440 model instead of the 7400A/B/C models.) <a href="http://www.oldcalculatormuseum.com/w-mits7400.html" target="_blank">http://www.oldcalculatormuseum.com/w-mits7400.html</a> <a href="#fnref:81" class="footnote-back-ref">↩</a></li>
<li id="fn:82">"Everything you've always wanted to know about RPN but were afraid to pursue – Comprehensive manual for scientific calculators – Corvus 500 – APF Mark 55 – OMRON 12-SR and others" (PDF). T. K. Enterprises. 1976. Archived (PDF) from the original on 2017-06-24. Retrieved 2017-06-24. (NB. The book's cover title contains a typographical error reading "APS Mark 55" instead of the correct "APF Mark 55".) <a href="http://www.wass.net/manuals/Everything%20RPN.pdf" target="_blank">http://www.wass.net/manuals/Everything%20RPN.pdf</a> <a href="#fnref:82" class="footnote-back-ref">↩</a></li>
<li id="fn:83">Ball, John A. (1978). Algorithms for RPN calculators (1 ed.). Cambridge, Massachusetts, USA: Wiley-Interscience, John Wiley & Sons, Inc. ISBN 0-471-03070-8. LCCN 77-14977. p. 2: […] In their advertisements and also in a letter to me, Hewlett-Packard Company (HP), the best known manufacturer of RPN calculators, says that RPN is based on a suggestion by Jan Łukasiewicz (1878–1956), and that RPN was invented and is patented by HP. Aside from the apparent contradiction in these two statements, I do not think that either of them is quite true. My first experience with RPN involved a nice old Friden EC-130 desktop electronic calculator, circa 1964. The EC-130 has RPN with a push-down stack of four registers, all visible simultaneously on a cathode ray tube display. Furthermore, they are shown upside down, that is, the last-in-first-out register is at the bottom. […] Around 1966, the Monroe Epic calculator offered RPN with a stack of four, a printer, and either 14 or 42 step programmability. The instruction booklets with these two calculators make no mention of RPN or Jan Łukasiewicz. […] <a href="0-471-03070-8" target="_blank">0-471-03070-8</a> <a href="#fnref:83" class="footnote-back-ref">↩</a></li>
<li id="fn:84">Paul, Matthias R. (2015-02-18) [2015-02-15]. "[34S] Proposal for Entry RPN mode with dynamic stack". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-23. Retrieved 2023-09-24. <a href="https://www.hpmuseum.org/forum/thread-3108.html" target="_blank">https://www.hpmuseum.org/forum/thread-3108.html</a> <a href="#fnref:84" class="footnote-back-ref">↩</a></li>
<li id="fn:85">Bit (2014-11-15). "Bit's WP 34S and 31S patches and custom binaries (version: r3802 20150805-1)". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24. <a href="https://www.hpmuseum.org/forum/thread-2433.html" target="_blank">https://www.hpmuseum.org/forum/thread-2433.html</a> <a href="#fnref:85" class="footnote-back-ref">↩</a></li>
<li id="fn:86">Bit (2015-02-07). "[34S & 31S] Unique display mode: significant figures". MoHPC - The Museum of HP Calculators. Archived from the original on 2023-09-24. Retrieved 2023-09-24. <a href="https://www.hpmuseum.org/forum/thread-3029.html" target="_blank">https://www.hpmuseum.org/forum/thread-3029.html</a> <a href="#fnref:86" class="footnote-back-ref">↩</a></li>
<li id="fn:87">https://forum.swissmicros.com/viewtopic.php?f=16&t=2939 <a href="https://forum.swissmicros.com/viewtopic.php?f=16&t=2939" target="_blank">https://forum.swissmicros.com/viewtopic.php?f=16&t=2939</a> <a href="#fnref:87" class="footnote-back-ref">↩</a></li>
<li id="fn:88">https://forum.swissmicros.com/viewtopic.php?f=15&t=2845 <a href="https://forum.swissmicros.com/viewtopic.php?f=15&t=2845" target="_blank">https://forum.swissmicros.com/viewtopic.php?f=15&t=2845</a> <a href="#fnref:88" class="footnote-back-ref">↩</a></li>
<li id="fn:89">"CGTK - ARPCalc - Al's Reverse Polish Calculator". <a href="https://www.cgtk.co.uk/software/arpcalc" target="_blank">https://www.cgtk.co.uk/software/arpcalc</a> <a href="#fnref:89" class="footnote-back-ref">↩</a></li>
<li id="fn:90">"Katharina & Paul Wilkins' Home Page". lashwhip.com. Retrieved 2018-03-21. <a href="http://lashwhip.com/grpn.html" target="_blank">http://lashwhip.com/grpn.html</a> <a href="#fnref:90" class="footnote-back-ref">↩</a></li>
<li id="fn:91">"galculator - a GTK 2 / GTK 3 algebraic and RPN calculator". galculator.mnim.org. Retrieved 2024-01-05. <a href="http://galculator.mnim.org/" target="_blank">http://galculator.mnim.org/</a> <a href="#fnref:91" class="footnote-back-ref">↩</a></li>
<li id="fn:92">Schrijver, Frans. "Home - mouseless Stack-Calculator". www.stack-calculator.com. Retrieved 2018-03-21. <a href="http://www.stack-calculator.com/" target="_blank">http://www.stack-calculator.com/</a> <a href="#fnref:92" class="footnote-back-ref">↩</a></li>
<li id="fn:93">"rpCalc". rpcalc.bellz.org. Retrieved 2024-01-05. <a href="https://rpcalc.bellz.org/" target="_blank">https://rpcalc.bellz.org/</a> <a href="#fnref:93" class="footnote-back-ref">↩</a></li>
<li id="fn:94">Geschke, Charles (1986) [1985]. Preface. PostScript Language Tutorial and Cookbook. By Adobe Systems Incorporated (27th printing, August 1998, 1st ed.). Addison Wesley Publishing Company. ISBN 0-201-10179-3. 9-780201-101799. (NB. This book is informally called "blue book" due to its blue cover.) <a href="0-201-10179-3" target="_blank">0-201-10179-3</a> <a href="#fnref:94" class="footnote-back-ref">↩</a></li>
<li id="fn:95">Adobe Systems Incorporated (February 1999) [1985]. PostScript Language Reference Manual (PDF) (1st printing, 3rd ed.). Addison-Wesley Publishing Company. ISBN 0-201-37922-8. Archived (PDF) from the original on 2017-02-18. Retrieved 2017-02-18. (NB. This book is informally called "red book" due to its red cover.) <a href="0-201-37922-8" target="_blank">0-201-37922-8</a> <a href="#fnref:95" class="footnote-back-ref">↩</a></li>
<li id="fn:96">Dagnat, Fabien; Keryell, Ronan; Aoun, Youssef; Sastre, Laura Barrero; de Rosière, Emmanuel Donin; Torneri, Nicolas (2003), "BibTeX++: Toward Higher-order BibTeXing" (PDF), Proceedings of EuroTeX 2003, TUGboat, 24 (3): 472–488 <a href="https://www.tug.org/TUGboat/Articles/tb24-3/keryell.pdf" target="_blank">https://www.tug.org/TUGboat/Articles/tb24-3/keryell.pdf</a> <a href="#fnref:96" class="footnote-back-ref">↩</a></li>
<li id="fn:97">Born, Günter [in German] (December 2000). "Kapitel 1. LOTUS 1-2-3-Format (WKS/WK1)" [Chapter 1. Lotus 1-2-3 WKS/WK1 format]. Dateiformate – Eine Referenz – Tabellenkalkulation, Text, Grafik, Multimedia, Sound und Internet [File formats – a reference – spreadsheets, text, graphics, multimedia, sound and internet] (PDF) (in German). Bonn, Germany: Galileo Computing. ISBN 3-934358-83-7. Archived (PDF) from the original on 2016-11-29. Retrieved 2016-11-28. <a href="3-934358-83-7" target="_blank">3-934358-83-7</a> <a href="#fnref:97" class="footnote-back-ref">↩</a></li>
<li id="fn:98">Born, Günter [in German] (December 2000). "Kapitel 2. LOTUS 1-2-3-Format (WK3)" [Chapter 2. Lotus 1-2-3 WK3 format]. Dateiformate – Eine Referenz – Tabellenkalkulation, Text, Grafik, Multimedia, Sound und Internet [File formats – a reference – spreadsheets, text, graphics, multimedia, sound and internet] (PDF) (in German). Bonn, Germany: Galileo Computing. ISBN 3-934358-83-7. Archived (PDF) from the original on 2016-11-29. Retrieved 2016-11-28. <a href="3-934358-83-7" target="_blank">3-934358-83-7</a> <a href="#fnref:98" class="footnote-back-ref">↩</a></li>
<li id="fn:99">Wickes, William C. (January–February 1987). "The HP-28C: An Insider's Perspective". HPX Exchange. 1 (1). [3] <a href="https://web.archive.org/web/20231006184209/https://www.hpmuseum.org/forum/thread-1140.html" target="_blank">https://web.archive.org/web/20231006184209/https://www.hpmuseum.org/forum/thread-1140.html</a> <a href="#fnref:99" class="footnote-back-ref">↩</a></li>
<li id="fn:100">Hewlett-Packard. "RPLMan from Goodies Disk 4" (RPLMAN.ZIP). Retrieved 2015-09-12. <a href="/wiki/Hewlett-Packard" target="_blank">/wiki/Hewlett-Packard</a> <a href="#fnref:100" class="footnote-back-ref">↩</a></li>
<li id="fn:101">Feichtinger, Herwig (1987). Arbeitsbuch Mikrocomputer (in German) (2 ed.). Munich, Germany: Franzis-Verlag GmbH. pp. 427–428. ISBN 3-7723-8022-0. (NB. According to this book, a 4 KB compiler was available from Lifeboat Software for CP/M.) <a href="3-7723-8022-0" target="_blank">3-7723-8022-0</a> <a href="#fnref:101" class="footnote-back-ref">↩</a></li>
<li id="fn:102">Wostrack, Gustav (January 1989). RPNL. Eine FORTH ähnliche Sprache mit strukturunterstützenden Sprachkonstrukten (in German). Wolf-Detlef Luther, Gens. ISBN 978-3-88707022-9. <a href="978-3-88707022-9" target="_blank">978-3-88707022-9</a> <a href="#fnref:102" class="footnote-back-ref">↩</a></li>
<li id="fn:103">Dietrich, Johannes W. (2019-07-24). "TRURL RPN Engine". Zenodo. doi:10.5281/zenodo.3257689. Retrieved 2022-07-02. <a href="https://zenodo.org/record/3350851" target="_blank">https://zenodo.org/record/3350851</a> <a href="#fnref:103" class="footnote-back-ref">↩</a></li>
</ol>

Reverse Polish notation open-in-new

Reverse Polish notation