Tecton: A language for manipulating generic objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 134 LNCS, Issue , 1982, Pages 402-414

  Kapur, Deepak ^a   Musser, David R ^a   Stepanov, Alexander A ^a  

^a GE GLOBAL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATIONS NETWORKS; FORMAL NOTATIONS; GENERIC OBJECTS; MANIPULATION; SPECIFICATION; TECTON COMPUTER LANGUAGE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0020255113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-11490-4_24     Document Type: Conference Paper

References (7)

1. Backus, J. , “Can programming be liberated from the yon Neumann Style? A functional style and its algebra of programs”, CACM 21 (8), August 1978.
2. Burstall, R. M. , Goguen, J. A. , “Putting Theories Together to Make Specifications”,Fifth International Joint Conference on Artificial Intelligence, Cambridge, MA, August 1977.
3. Guttag, J. V. , “Abstract Data Types and the Development of Data Structures”, CACM 20 (6), pp. 396-404, June 1977.
4. Iverson, K. E. , “Operators”, TOPLAS 2 (1), October 1979.
5. Kaput, D. , Musser, D. R. , Stepanov, A. A. , “Operators and Algebraic Structures”, Proceedings of the Conference on Functional Programming Languages and Computer Architecture, New Hampshire, Oct. 1981.
6. Liskov, B. H. , Snyder, A. , Atkinson, R. , Schaffert, C. “Abstraction Mechanisms in CLU”, CACM 20 (8), pp. 564-576, Aug. 1977.
7. Nakajima, R. , Nakahara, H. , Honda, M. , “Hierarchical Program Specification and Verification - A Many Sorted Logical Approach”, preprint RIMS 256, November 1978.