applicative computing systems
object calculi systems
≈ 3 min read
applicative computing systems. encyclopegia.org, snapshot applicative-computing-systems-466463-8b10fb1b0959f69f. /a/applicative-computing-systems
Names in other languages
- Русскийаппликативные вычислительные системытехника аппликативных вычислений
- Українськааплікативні обчислювальні системитехніка аплікативних обчислень
- Englishapplicative computing systems
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Applicative computing systems, or ACS are the systems of object calculi founded on combinatory logic and lambda calculus.[1] The only essential notion which is under consideration in these systems is the representation of object. In combinatory logic the only metaoperator is application in the sense of applying one object to other. In lambda calculus two metaoperators are used: application – the same as in combinatory logic, and functional abstraction which binds the only variable in one object.
Features
edit edit sourceThe objects generated in these systems are the functional entities with the following features:
- the number of argument places, or object arity is not fixed but is enabling step by step in interoperations with other objects;
- 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;
- the self-applying of functions is allowed, i.e. any object can be applied to itself.
ACS give a sound ground for applicative approach to programming.
Research challenge
edit edit sourceApplicative 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 lambda calculus 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.[2]
See also
edit edit source- Applicative programming language
- Categorical abstract machine
- Combinatory logic
- Functional programming
- Lambda calculus
References
edit edit source- ^ 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. Wikipedia revision 1337589109, retrieved 2026-11-20
- ^ 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. Wikipedia revision 1337589109, retrieved 2026-11-20
Further reading
edit edit source- Hindley, J. Roger; Seldin, Jonathan P., eds. (September 1980), To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism, Boston, MA: Academic Press, ISBN 978-0-12-349050-6 [This volume reflects the research program and philosophy of H. Curry, one of the founders of computational models and the deductive framework for reasoning in terms of objects.]
- Wolfengagen, V.E. (2003). Combinatory logic in programming. Computations with objects through examples and exercises (2nd ed.). JurInfoR. CiteSeerX 10.1.1.62.4421. ISBN 9785891581265. OCLC 491339472.
{{cite book}}: Cite uses deprecated parameter|citeseerx=(help)
Text derived from https://en.wikipedia.org/w/index.php?oldid=1337589109 under CC BY-SA 4.0; modifications have been made.