Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800178.810101acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-national-conferenceConference Proceedingsconference-collections
Article
Free access

Assignments and high level data types

Published: 01 January 1978 Publication History

Abstract

If x and y are integer variables or any other variables of a “simple” type, then the meaning of the assignment x=y is quite similar in different programming languages. The value of y is copied (into a register) and then stored into x so that a fresh copy of the value of y becomes the current value of x. On the other hand if x and y are compound objects the the situation is quite different: some languages don't allow assignments at all, and other languages call for a conditional copying depending on the form of the right hand side. This paper argues for a unified view on assignment with semantics, that can be described in terms independent of the complexity of the type of the variables involved. We also present some alternatives to assignments and discuss their consequences for programming with complex data types.

References

[1]
Dahl O.J., Myhrhaug D., Nygard K., Common Base Language, NCC Publ S-22, 1970
[2]
Dijkstra E. E., A Discipline of Programming, Prentice Hall, 1976
[3]
Hoare C. A. R., Procedures and Parameters: an Axiomatic Approach, in: Semantics of Algorithmic Languages, Springer Lecture Notes in Mathematics, vol. 188
[4]
Hoare C. A. R., Recursive Data Structures, Stanford Report, STAN-73-400, C.Sc. dept., Stanford University, California
[5]
Hoare C.A.R., Proof of Correctness of Data Representation, Acta Informatica 1, 271-281, 1972
[6]
Ingargiola G., Basic Features of CALEX, Inf Sc Rep nr 9, June 1974, Calif Inst of Teach, Pasadena, California
[7]
Kieburtz R., Four Principles of Programming Languages, internal memo, Dept of C.Sc. SUNY at Stony Brook
[8]
Liskov B., Abstraction Mechanisms in CLU, CACM Vol 20 nr 8, Aug. 1977
[9]
Schwartz J. T., Optimization of Very High Level Languages, Computer Languages. Vol. 1, pp 161-194, 1975
[10]
Scott D., Mathematical Concepts in Programming Language Semantics, Proc. AFIPS SJCC, vol. 40, 1972
[11]
Wirth N., The Programming Language Pascal (Revised report), Eidg Technische Hochschule, Zürich, 1972

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ACM '78: Proceedings of the 1978 annual conference - Volume 2
January 1978
990 pages
ISBN:0897910001
DOI:10.1145/800178
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1978

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Adress
  2. Assignment
  3. Data types
  4. Mathematical semantics
  5. Pointers

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)52
  • Downloads (Last 6 weeks)8
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media