Copy
A. K. CHAKRAVARTY, Tadao NAKAMURA, Yoshiharu SHIGEI, "A Hierarchical Computation Scheme" in IEICE TRANSACTIONS on transactions,
vol. E68-E, no. 7, pp. 484-491, July 1985, doi: .
Abstract: In recent years a lot of attention has been focused on writing error-free programs in an easily readable and understandable manner. It is also recognized that the so called von Neumann" or Imperative" languages may not be the right medium to work in this direction as these have a complex body lacking the solid foundation of computational mathematics. With the announcement of yet another such language, there is a further addition of various new language constructs thereby only helping to build up the confusion. On the other hand, functional languages are based upon a solid foundation and produce programs which are semantically very clear. These language, however, have not found favor with the computing community primarily because these are not history sensitive apart from being inefficient to run on presently available computers. An appearling alternative has been proposed by Backus in terms of an applicative language independent of the lambda calculus and possessing history sensitivity by means of a loose coupling between computation and the state (of the store). In this paper, we pick up his ideas and work up a computation scheme which introduces an amount of abstraction in the representation of variables. Specifically, we do not bind a variable to a particular value to the declared type, but rather we assign limits to the values of the variable. These limits are changeable and depend upon the available semantic information. It is observed that such a scheme can exploit the potentials of working at higher levels, notable among which in this particular scheme is, the possibility of considerable increase in the speed of computation.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e68-e_7_484/_p
Copy
@ARTICLE{e68-e_7_484,
author={A. K. CHAKRAVARTY, Tadao NAKAMURA, Yoshiharu SHIGEI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Hierarchical Computation Scheme},
year={1985},
volume={E68-E},
number={7},
pages={484-491},
abstract={In recent years a lot of attention has been focused on writing error-free programs in an easily readable and understandable manner. It is also recognized that the so called von Neumann" or Imperative" languages may not be the right medium to work in this direction as these have a complex body lacking the solid foundation of computational mathematics. With the announcement of yet another such language, there is a further addition of various new language constructs thereby only helping to build up the confusion. On the other hand, functional languages are based upon a solid foundation and produce programs which are semantically very clear. These language, however, have not found favor with the computing community primarily because these are not history sensitive apart from being inefficient to run on presently available computers. An appearling alternative has been proposed by Backus in terms of an applicative language independent of the lambda calculus and possessing history sensitivity by means of a loose coupling between computation and the state (of the store). In this paper, we pick up his ideas and work up a computation scheme which introduces an amount of abstraction in the representation of variables. Specifically, we do not bind a variable to a particular value to the declared type, but rather we assign limits to the values of the variable. These limits are changeable and depend upon the available semantic information. It is observed that such a scheme can exploit the potentials of working at higher levels, notable among which in this particular scheme is, the possibility of considerable increase in the speed of computation.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - A Hierarchical Computation Scheme
T2 - IEICE TRANSACTIONS on transactions
SP - 484
EP - 491
AU - A. K. CHAKRAVARTY
AU - Tadao NAKAMURA
AU - Yoshiharu SHIGEI
PY - 1985
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E68-E
IS - 7
JA - IEICE TRANSACTIONS on transactions
Y1 - July 1985
AB - In recent years a lot of attention has been focused on writing error-free programs in an easily readable and understandable manner. It is also recognized that the so called von Neumann" or Imperative" languages may not be the right medium to work in this direction as these have a complex body lacking the solid foundation of computational mathematics. With the announcement of yet another such language, there is a further addition of various new language constructs thereby only helping to build up the confusion. On the other hand, functional languages are based upon a solid foundation and produce programs which are semantically very clear. These language, however, have not found favor with the computing community primarily because these are not history sensitive apart from being inefficient to run on presently available computers. An appearling alternative has been proposed by Backus in terms of an applicative language independent of the lambda calculus and possessing history sensitivity by means of a loose coupling between computation and the state (of the store). In this paper, we pick up his ideas and work up a computation scheme which introduces an amount of abstraction in the representation of variables. Specifically, we do not bind a variable to a particular value to the declared type, but rather we assign limits to the values of the variable. These limits are changeable and depend upon the available semantic information. It is observed that such a scheme can exploit the potentials of working at higher levels, notable among which in this particular scheme is, the possibility of considerable increase in the speed of computation.
ER -
English
