Applicative computing systems

<h2 id="features">Features</h2>
<p>The objects generated in these systems are the functional entities with the following features:
</p>
<ol><li>the number of argument places, or object arity is not fixed but is enabling step by step in interoperations with other objects;</li>
<li>in a process of generating the compound object one of its counterparts—function—is applied to other one—argument—but in other contexts they can change their roles, i.e. functions and arguments are considered on the equal rights;</li>
<li>the self-applying of functions is allowed, i.e. any object can be applied to itself.</li></ol>
<p>ACS give a sound ground for <a href="/facts/Applicative_programming_language/QzX3hSc4">applicative approach</a> to programming.
</p>
<h2 id="research-challenge">Research challenge</h2>
<p>Applicative computing systems' lack of storage and history sensitivity is the basic reason they have not provided a foundation for computer design. Moreover, most applicative systems employ the substitution operation of the <a href="/facts/Lambda_calculus/DaD3RuQ4">lambda calculus</a> as their basic operation. This operation is one of virtually unlimited power, but its complete and efficient realization presents great difficulties to the machine designer.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a>
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Applicative_programming_language/QzX3hSc4">Applicative programming language</a></li>
<li><a href="/facts/Categorical_abstract_machine/CTTPs7IH">Categorical abstract machine</a></li>
<li><a href="/facts/Combinatory_logic/D7NNo4xT">Combinatory logic</a></li>
<li><a href="/facts/Functional_programming/cdxqPEIM">Functional programming</a></li>
<li><a href="/facts/Lambda_calculus/DaD3RuQ4">Lambda calculus</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li><a href="/facts/J._Roger_Hindley/clPxofjg">Hindley, J. Roger</a>; Seldin, Jonathan P., eds. (September 1980), <i>To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism</i>, Boston, MA: <a href="/facts/Academic_Press/qxoKjzFy">Academic Press</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-12-349050-6 [This volume reflects the research program and philosophy of <a href="/facts/Haskell_Curry/PsNUI4Gn">H. Curry</a>, one of the founders of <a href="/facts/Computational_models/dq1CR6us">computational models</a> and the deductive framework for reasoning in terms of objects.]</li></ul>
<ul><li>Wolfengagen, V.E. (2003). <i>Combinatory logic in programming. Computations with objects through examples and exercises</i> (2nd ed.). JurInfoR. <a href="/facts/CiteSeerX_(identifier)/SceDmd3c">CiteSeerX</a> <a href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4421">10.1.1.62.4421</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9785891581265. <a href="/facts/OCLC_(identifier)/Yqad8waq">OCLC</a> <a href="https://search.worldcat.org/oclc/491339472">491339472</a>.</li></ul>

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

<ol>
<li id="fn:1"><p>Wolfengagen V.E. Methods and means for computations with objects. Applicative Computational Systems. — M.: JurInfoR Ltd., «Center JurInfoR», 2004. — xvi+789 pp. ISBN 5-89158-100-0. <a href="/wiki/ISBN_(identifier)" target="_blank">/wiki/ISBN_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Backus, J. (1978). "1977 Turing Award Lecture: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs". Commun. ACM. 2 (8): 613–641. doi:10.1145/359576.359579. S2CID 16367522. <a href="/wiki/John_Backus" target="_blank">/wiki/John_Backus</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
</ol>

Applicative computing systems open-in-new

Applicative computing systems