Skip to main content

Treatment of big values in an applicative language HFP

Translation from by-value access to by-update access

  • 109 Accesses

Part of the Lecture Notes in Computer Science book series (LNCS,volume 147)


  • Computation Tree
  • Output Attribute
  • Initial Module
  • Input Attribute
  • Decomposition Condition

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Backus, J. Can programming Be Liberated from the von Neumamm Style? A Functional Style and Its Algebra. Comm. ACM, 21,8(Aug.1978), 613–641

    Google Scholar 

  2. Henderson,P. & Morris,J.H. A Lazy Evaluator. Proc. of 3rd ACM Smp. on Principle of Programming Languages (1976)

    Google Scholar 

  3. Katayama, T. HFP: A Hierarchical and Functional Programming Based on Attribue Grammar,Proc. 5th Int. Conf. On Software Engineering (1981)

    Google Scholar 

  4. Katayama,T., and Hoshino, Y. Verification of Attribute Grammars. Proc. 8th ACM Symposium on Principles of Programming Languages (1981)

    Google Scholar 

  5. Kunth, D.E. Semantics of context-free languages Math. Syst. Theoty J.2(1968),127–145

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katayama, T. (1983). Treatment of big values in an applicative language HFP. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds) RIMS Symposia on Software Science and Engineering. Lecture Notes in Computer Science, vol 147. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11980-7

  • Online ISBN: 978-3-540-39442-6

  • eBook Packages: Springer Book Archive