article

Free access

CSSA: Language concepts and programming methodology

Authors:

H. P. Böhm,

H. L. Fischer,

P. RaulefsAuthors Info & Claims

ACM SIGPLAN Notices, Volume 12, Issue 8

Pages 100 - 108

https://doi.org/10.1145/872734.806938

Published: 01 August 1977 Publication History

PDF eReader

Abstract

CSSA (Computing System for Societies of Actors) is an experimental programming language that originated from an attempt to design a language combining various new ideas having evolved from the fields of semantics of programming languages, artificial intelligence, programming methodology, and language design in recent years: (1) Abstraction semantics improving denotational semantics by describing the semantics of programming language constructs uniformly in terms of operational abstractions [1,2]. (2) Some features of CSSA have been inspired by the actor concept of PLASMA [3].(3) Programming in terms of control and data abstractions. (4) Heirarchical control structures (dynamic generation and manipulation of actor nets). (5) Definable access operations and access control to shared data [4]. (6) Data driven and goal directed computation.

References

[1]

Raulefs, P. Tech. Rept., Inst. f. Informatik I, Univ. Karlsruhe. Fall 1977 (forthcoming).

Google Scholar

[2]

Raulefs, P. Proc. Int. Symp. on Math. Foundations of Computer Science. High Tatras, Sept. 1977.

Google Scholar

[3]

Hewitt, C. and B. Smith. IEEE-SE:1 (1975)26-45.

Google Scholar

[4]

Jones, A. and B. Liskov. IEEE-SE:2 (1976)277-284.

Google Scholar

[5]

Liskov, B. and S. N. Zilles. IEEE-SE:1 (1975)7-18.

Google Scholar

[6]

Goguen, J. A., J. W. Thatcher, E. G. Wagner, and J. B. Wright (ADJ). Proc. Conf. on Computer Graphics, Pattern recognition and Data Structures. May 1975. pp. 89-93.

Google Scholar

[7]

Lee, J. A. N. Computer Semantics. Van Nostrand Reinhold Co., 1972.

Google Scholar

[8]

Milne, R. E. and Ch. Strachey. A theory of programming language semantics. Chapman & Hall, 1976.

Digital Library

Google Scholar

[9]

Liskov, B. Comp. Struct. Group Memo 136, MIT L.C.S., Feb. 1976.

Google Scholar

[10]

Wulf, W. A., R. L. London, M. Shaw. IEEE-SE:2 (1976)253-264.

Google Scholar

[11]

Wang, A. and O.-J. Dahl. BIT:11 (1971)425-449.

Google Scholar

[12]

Kahn, G. and D. McQueen. Tech. Rept. 202, IRIA, Dec. 1976.

Google Scholar

[13]

Kahn, G. Proc. IFIP 74, North-Holland Publ. Co., 1974.

Google Scholar

[14]

Guttag, J. V., E. Horowitz, and D. R. Musser. Tech. Rept. ISI/RR- 76-48, Aug. 1976. Univ. Southern Cal. Information Sci. Inst.

Google Scholar

Cited By

View all

Nehmer J(2005)On the adequate support of communication interfaces in distributed systemsExperiences with Distributed Systems10.1007/3-540-19333-2_1(1-18)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-19333-2_1
Boley H(1980)A preliminary survey of artificial intelligence machinesACM SIGART Bulletin10.1145/1056447.1056449(21-28)Online publication date: 1-Jul-1980
https://dl.acm.org/doi/10.1145/1056447.1056449
Siekmann J(1984)Universal Unification7th International Conference on Automated Deduction10.1007/978-0-387-34768-4_1(1-42)Online publication date: 1984
https://doi.org/10.1007/978-0-387-34768-4_1
Show More Cited By

Index Terms

CSSA: Language concepts and programming methodology
1. Software and its engineering
  1. Software creation and management
    1. Designing software
      1. Software implementation planning
        Software design techniques
    2. Software development process management
  2. Software notations and tools
    1. Formal language definitions
      1. Semantics
    2. General programming languages
      1. Language features
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
    2. Program semantics

Recommendations

CSSA: Language concepts and programming methodology
Proceedings of the 1977 symposium on Artificial intelligence and programming languages

CSSA (Computing System for Societies of Actors) is an experimental programming language that originated from an attempt to design a language combining various new ideas having evolved from the fields of semantics of programming languages, artificial ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 12, Issue 8

Proceedings of the 1977 symposium on Artificial intelligence and programming languages

August 1977

179 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/872734

Issue’s Table of Contents

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
August 1977
185 pages
ISBN:9781450378741
DOI:10.1145/800228
Chairman:
James Low

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1977

Published in SIGPLAN Volume 12, Issue 8

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
401
Total Downloads

Downloads (Last 12 months)160
Downloads (Last 6 weeks)31

Reflects downloads up to 14 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nehmer J(2005)On the adequate support of communication interfaces in distributed systemsExperiences with Distributed Systems10.1007/3-540-19333-2_1(1-18)Online publication date: 27-May-2005
https://doi.org/10.1007/3-540-19333-2_1
Boley H(1980)A preliminary survey of artificial intelligence machinesACM SIGART Bulletin10.1145/1056447.1056449(21-28)Online publication date: 1-Jul-1980
https://dl.acm.org/doi/10.1145/1056447.1056449
Siekmann J(1984)Universal Unification7th International Conference on Automated Deduction10.1007/978-0-387-34768-4_1(1-42)Online publication date: 1984
https://doi.org/10.1007/978-0-387-34768-4_1
Raulefs PSiekmann JSzabó PUnvericht E(1979)A short survey on the state of the art in matching and unification problemsACM SIGSAM Bulletin10.1145/1089208.108921013:2(14-20)Online publication date: 1-May-1979
https://dl.acm.org/doi/10.1145/1089208.1089210

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations