Advertisement

Coroutines pp 191-228 | Cite as

Conclusions and further research

Chapter 7
Part of the Lecture Notes in Computer Science book series (LNCS, volume 95)

Keywords

Activation Record Active List Language Design Main Program Reference Parameter 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Aiello, M. Aiello, G. Attardi, P. Cavallari and G. Prini, "Formal Definition of Semantics of Generalized Control Regimes", Mathematical Foundations of Computer Science 1976, A.Mazurkiewicz (Ed.) {Lecture Notes in Computer Science, Vol.45}, pp.173–179 (Springer-Verlag, Berlin, 1976).Google Scholar
  2. [2]
    A.L. Ambler, D.I. Good, J.C. Browne, W.F. Burger, R.M. Cohen, C.G. Hoch and R.E. Wells, "Gypsy: A Language for Specification and Implementation of Verifiable Programs", Proc. A.C.M. Conference on Language Design for Reliable Software, D.B.Wortman (Ed.) {A.C.M. SIGPLAN Notices, Vol.12, No.3 (March 1977)}, pp.1–10.Google Scholar
  3. [3]
    American National Standards Institute, USA Standard FORTRAN, ANSI X3.9-1966 {Approved March 7, 1966} (A.N.S.I., New York,1966).Google Scholar
  4. [4]
    U.Ammann, "Advantages of the Value Parameter (VP) Over the Constant Parameter (CP)", unpublished memorandum {Translated and augmented by N.Wirth, 5 July 1972}, Institut für Informatik, Eidgenössische Technische Hochschule, Zürich (3 July 1972).Google Scholar
  5. [5]
    U. Ammann, "The Method of Structured Programming Applied to the Development of a Compiler", Proc. International Computing Symposium 1973, A. Günther, B. Levrat and H. Lipps (Eds.), pp.93–99 (North Holland Pub. Co., Amsterdam, 1974).Google Scholar
  6. [6]
    E.A. Ashcroft and W.W. Wadge, "Clauses: Scope Structures and Defined Functions in Lucid", Conf. Record of the Fifth A.C.M. Symposium on Principles of Programming Languages, pp.17–22 (A.C.M., New York, 1978).Google Scholar
  7. [7]
    K.Babcicky, personal communications (5th April 1977, 9th August 1977).Google Scholar
  8. [8]
    K. Babcicky, "Some Notes on SDG Recommendation No. 2", Simula Newsletter, Vol.6, No.2 (May 1978), pp.15–17.Google Scholar
  9. [9]
    D.W. Barron, An Introduction to the Study of Programming Languages (Cambridge University Press, Cambridge, 1977).Google Scholar
  10. [10]
    C.J. Barter, "Programming with Interacting Processes", Technical Report No.75-01, Department of Computing Science, The University of Adelaide, Adelaide, South Australia (1975).Google Scholar
  11. [11]
    C.J. Barter, "Data Transformations and Program Transformations", Programming Language Systems, M.C. Newey, R.B. Stanton and G.L. Wolfendale (Eds.), pp.39–59 (Australian National University Press, Canberra, Australian Capital Territory, 1978).Google Scholar
  12. [12]
    R.D. Bergeron, J.D. Gannon, D.P. Shecter, F.W. Tompa and A. van Dam, "Systems Programming Languages", Advances in Computers, M.Rubinoff (Ed.), Vol.12 (1972), pp.175–284.Google Scholar
  13. [13]
    D.M. Berry, "Introduction to Oregano", Proc. Symposium on Data Structures in Programming Languages, J.T.Tou and P.Wegner (Eds.) {A.C.M. SIGPLAN Notices, Vol.6, No.2 (February 1971)}, pp.171–190.Google Scholar
  14. [14]
    D.M. Berry, "Block Structure: Retention or Deletion", Conf. Record of Third Annual A.C.M. Symposium on Theory of Computing, pp.86–100 (A.C.M., New York, 1971).Google Scholar
  15. [15]
    D.M. Berry, L. Chirica, J.B. Johnston, D.F. Martin and A. Sorkin, "On the Time Required for Retention", Proc. Symposium on High-Level-Language Computer Architecture {A.C.M. SIGPLAN Notices, Vol.8, No.11 (November 1973)}, pp.165–178.Google Scholar
  16. [16]
    G.M. Birtwistle, O.-J. Dahl, B. Myhrhaug and K. Nygaard, Simula Begin (Studentlitteratur, Sweden; Auerbach Publishers Inc., Philadelphia, Pennsylvania; 1973).Google Scholar
  17. [17]
    G.M. Birtwistle, L. Enderin, M. Ohlin and J. Palme, DECsystem-10 SIMULA Language Handbook Part I, Swedish National Defense Research Institute & Norwegian Computing Center {also: Report C 8398-M3 (E5), Swedish National Defense Research Institute, Stockholm, Sweden (December 1975)}.Google Scholar
  18. [18]
    D.G. Bobrow and B. Raphael, "New Programming Languages for Artificial Intelligence Research", Computing Surveys, Vol.6, No.3 (September 1974), pp.153–174.Google Scholar
  19. [19]
    D.G. Bobrow and B. Wegbreit, "A Model and Stack Implementation of Multiple Environments", Comm. A.C.M., Vol.16, No.10 (October 1973), pp.591–603.Google Scholar
  20. [20]
    D.G. Bobrow and B. Wegbreit, "A Model for Control Structures for Artificial Intelligence Programming Languages", I.E.E.E. Trans. on Computers, Vol.C-25, No.4 (April 1976), pp.347–353.Google Scholar
  21. [21]
    D.E. Britton, F.C. Druseikis, R.E. Griswold, D.R. Hanson and R.A. Holmes, "Procedure Referencing Environments in SL5", Conf. Record of the Third A.C.M. Symposium on Principles of Programming Languages, pp.185–191 (A.C.M., New York, 1976).Google Scholar
  22. [22]
    Burroughs Corporation, "Burroughs B7000/B6000 ALGOL Language Reference Manual" (Burroughs Corporation, Detroit, Michigan, 1977).Google Scholar
  23. [23]
    E. Chang, N.E. Kaden and W.D. Elliott, "Abstract Data Types in Euclid", A.C.M. SIGPLAN Notices, Vol.13, No.3 (March 1978), pp.34–42.Google Scholar
  24. [24]
    L.M. Chirica, T.A. Dreisbach, D.F. Martin, J.G. Peetz and A. Sorkin, "Two PARALLEL EULER Run Time Models: the Dangling Reference, Imposter Environment, and Label Problems", Proc. Symposium on High-Level-Language Computer Architecture {A.C.M. SIGPLAN Notices, Vol.8, No.11 (November 1973)}, pp.141–151.Google Scholar
  25. [25]
    E.M. Clarke, Jr., "Programming Language Constructs for which it is Impossible to Obtain Good Hoare-like Axiom Systems", Conf. Record of the Fourth A.C.M. Symposium on Principles of Programming Languages, pp.10–19 (A.C.M., New York, 1977).Google Scholar
  26. [26]
    E.M. Clarke, Jr., "Proving Correctness of Coroutines without History Variables", Technical Report CS-1978-4, Department of Computer Science, Duke University, Durham, North Carolina (March 1978).Google Scholar
  27. [27]
    M. Clint, "Program Proving: Coroutines", Acta Informatica, Vol.2 (1973), pp.50–63.Google Scholar
  28. [28]
    L.L. Constantine, "Control of Sequence and Parallelism in Modular Programs", Proc. Spring Joint Computer Conference 1968 {A.F.I.P.S. Conference Proceedings, Vol.32}, pp.409–414 (Thompson Book Co., Washington, D.C., 1968).Google Scholar
  29. [29]
    M.E. Conway, "Design of a Separable Transition-Diagram Compiler", Comm. A.C.M., Vol.6, No.7 (July 1963), pp.396–408.Google Scholar
  30. [30]
    O.-J. Dahl, "Discrete Event Simulation Languages", Programming Languages, F. Genuys (Ed.), pp.349–395 (Academic Press, London, 1968).Google Scholar
  31. [31]
    O.-J. Dahl, "An Approach to Correctness Proofs of Semicoroutines", Mathematical Foundations of Computer Science — Third Symposium, A. Blikle (Ed.) {Lecture Notes in Computer Science, Vol.28}, pp.157–174 (Springer-Verlag, Berlin, 1975).Google Scholar
  32. [32]
    O.-J. Dahl and C.A.R. Hoare, "Hierarchical Program Structures", Structured Programming, O.-J.Dahl, E.W.Dijkstra and C.A.R.Hoare {A.P.I.C. Studies in Data Processing, No.8}, pp.175–220 (Academic Press, London, 1972).Google Scholar
  33. [33]
    O.-J. Dahl, B. Myhrhaug and K. Nygaard, "Common Base Language", Publication No. S-22, Norwegian Computing Center, Oslo, Norway (October 1970).Google Scholar
  34. [34]
    J.B.Dennis, "Coroutines and Parallel Computation", Proc. Fifth Annual Princeton Conf. on Information Sciences and Systems 1971, pp.293–294.Google Scholar
  35. [35]
    E.W. Dijkstra, "Notes on Structured Programming", Structured Programming, O.-J.Dahl, E.W.Dijkstra and C.A.R.Hoare {A.P.I.C. Studies in Data Processing, No.8}, pp.1–82 (Academic Press, London, 1972).Google Scholar
  36. [36]
    E.W. Dijkstra, A Discipline of Programming (Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1976).Google Scholar
  37. [37]
    J.N.Doyle, "A Generalized Facility for the Analysis and Synthesis of Strings, and a Procedure-based Model of an Implementation", Technical Report S4D48, Department of Computer Science, The University of Arizona, Tucson, Arizona (February 1975).Google Scholar
  38. [38]
    F.C.Druseikis, "The Design of Transportable Interpreters", SNOBOL4 Project Document S4D49, Department of Computer Science, The University of Arizona, Tucson, Arizona (February 1975).Google Scholar
  39. [39]
    F.C. Druseikis and J.N. Doyle, "A Procedural Approach to Pattern Matching in SNOBOL4", A.C.M. National Conference Proceedings, Vol.29 (1974), pp.311–317.Google Scholar
  40. [40]
    M. Elson, Concepts of Programming Languages (Science Research Associates Inc., Chicago, Illinois, 1973).Google Scholar
  41. [41]
    M. Elson, Data Structures (Science Research Associates Inc., Chicago, Illinois, 1975).Google Scholar
  42. [42]
    C.N. Fischer and R.J. LeBlanc, "Efficient Implementation and Optimization of Run-time Checking in Pascal", Proc. A.C.M. Conf. on Language Design for Reliable Software, D.B.Wortman (Ed.) {A.C.M. SIGPLAN Notices, Vol.12, No.3 (March 1977)}, pp.19–24.Google Scholar
  43. [43]
    D.A. Fisher, "A Survey of Control Structures in Programming Languages", Control Structures in Programming Languages, B.M.Leavenworth (Ed.) {A.C.M. SIGPLAN Notices, Vol.7, No.11 (November 1972)}, pp.1–13.Google Scholar
  44. [44]
    D.A. Fisher, "DoD's Common Programming Language Effort", Computer, Vol.11, No.3 (March 1978), pp.24–33.Google Scholar
  45. [45]
    R.W. Floyd, "Nondeterministic Algorithms", J. A.C.M., Vol.14, No.4 (October 1967), pp.636–644.Google Scholar
  46. [46]
    R.W. Floyd, "The Paradigms of Programming", Comm. A.C.M., Vol.22, No.8 (August 1979), pp.455–460.Google Scholar
  47. [47]
    N. Francez, "Another Advantage of Keyword Notation for Parameter Communication with Subprograms", Comm. A.C.M., Vol.20, No.8 (August 1977), pp.604–605.Google Scholar
  48. [48]
    J.D. Gannon, "Language Design to Enhance Programming Reliability", Technical Report CSRG-47, Computer Systems Research Group, University of Toronto, Toronto, Ontario (January 1975).Google Scholar
  49. [49]
    W.M.Gentleman, "Simplified Coroutine System — System Survey and User's Manual", (Simplified Coroutine System) Technical Note No. 3, Dept. of Applied Analysis and Computer Science, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  50. [50]
    W.M.Gentleman, "Protable Coroutine System — The Translator", (Portable Coroutine System) Technical Note No.4, Dept. of Applied Analysis and Computer Science, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
  51. [51]
    W.M. Gentleman, "A Portable Coroutine System", Information Processing 71, C.V. Freiman (Ed.), pp.419–424 (North Holland Pub. Co., Amsterdam, 1972).Google Scholar
  52. [52]
    W.K. Giloi and R. Hoffmann, "Adding a Modern Control Structure to APL without Changing the Syntax", Proc. APL76 Conference, pp.189–194 (A.C.M., New York, 1976).Google Scholar
  53. [53]
    R.E. Griswold, "Extensible Pattern Matching in SNOBOL4", Proc. A.C.M. Annual Conference 1975, pp.248–252 (A.C.M., New York, 1975).Google Scholar
  54. [54]
    R.E. Griswold, "String Analysis and Synthesis in SL5", Proc. A.C.M. Annual Conference 1976, pp.410–414 (A.C.M., New York, 1976).Google Scholar
  55. [55]
    R.E. Griswold, "An Alternative to SIL", Software Portability, P.J. Brown (Ed.), pp. 291–298 (Cambridge University Press, Cambridge, 1977).Google Scholar
  56. [56]
    R.E. Griswold and D.R. Hanson, "An Overview of SL5", A.C.M. SIGPLAN Notices, Vol.12, No.4 (April 1977), pp.40–50.Google Scholar
  57. [57]
    R.E. Griswold and D.R. Hanson, "Language Facilities for Programmable Backtracking", Proc. Symposium on Artificial Intelligence and Programming Languages {A.C.M. SIGPLAN Notices, Vol.12, No.8 (August 1977) and A.C.M. SIGART Newsletter, No.64 (August 1977)}, pp.94–99.Google Scholar
  58. [58]
    R.E. Griswold, D.R. Hanson and J.T. Korb, "The Icon Programming Language: An Overview", A.C.M. SIGPLAN Notices, Vol.14, No.4 (April 1979), pp.18–31.Google Scholar
  59. [59]
    D. Grune, "A View of Coroutines", A.C.M. SIGPLAN Notices, Vol.12, No.7 (July 1977), pp.75–81.Google Scholar
  60. [60]
    D.R. Hanson, "A Simple Variant of the Boundary-tag Algorithm for the Allocation of Coroutine Environments", Information Processing Letters, Vol.4, No.4 (January 1976), pp.109–112.Google Scholar
  61. [61]
    D.R. Hanson, "A Procedure Mechanism for Backtrack Programming", Proc. A.C.M. Annual Conference 1976, pp.401–405 (A.C.M., New York, 1976).Google Scholar
  62. [62]
    D.R. Hanson and R.E. Griswold, "The SL5 Procedure Mechanism", Comm. A.C.M., Vol.21, No.5 (May 1978), pp.392–400.Google Scholar
  63. [63]
    W.T. Hardgrave, "Positional versus Keyword Parameter Communication in Programming Languages", A.C.M. SIGPLAN Notices, Vol.11, No.5 (May 1976), pp.52–58.Google Scholar
  64. [64]
    P. Henderson and R. Snowdon, "An Experiment in Structured Programming", B.I.T., Vol.12 (1972), pp.38–53.Google Scholar
  65. [65]
    R.G. Herriot, The Definition of the Control and Environment Structure of Programming Languages, Ph.D. Thesis, Department of Computer Science, The University of Wisconsin, Madison, Wisconsin (1971).Google Scholar
  66. [66]
    C.A.R. Hoare, "An Axiomatic Basis for Computer Programming", Comm. A.C.M., Vol.12, No.10 (October 1969), pp.576–581,583.Google Scholar
  67. [67]
    C.A.R.Hoare, "Hints on Programming Language Design", Stanford A.I. Lab. Memo AIM-224 {also: Computer Science Department Report STAN-CS-73-403}, Stanford University, Stanford, California (October 1973).Google Scholar
  68. [68]
    C.A.R. Hoare, "Recursive Data Structures", Int. J. of Comp. and Inf. Sciences, Vol.4, No.2 (1975), pp.105–132.Google Scholar
  69. [69]
    C.A.R. Hoare and N. Wirth, "An Axiomatic Definition of the Programming Language Pascal", Acta Informatica, Vol.2 (1973), pp.335–355.Google Scholar
  70. [70]
    J.D. Ichbiah and S.P. Morse, "General Concepts of the Simula67 Programming Language", Annual Review in Automatic Programming, Vol.7, Part 1 (1972), pp.65–93.Google Scholar
  71. [71]
    M.A. Jackson, Principles of Program Design {A.P.I.C. Studies in Data Processing, No.12} (Academic Press, London, 1975).Google Scholar
  72. [72]
    T. Jacobsen, "Another View of Coroutines", A.C.M. SIGPLAN Notices, Vol.13, No.4 (April 1978), pp.68–75.Google Scholar
  73. [73]
    R. Janicki, "Vectors of Coroutines", Mathematical Foundations of Computer Science 1976, A. Mazurkiewicz (Ed.) {Lecture Notes in Computer Science, Vol.45}, pp.377–384 (Springer-Verlag, Berlin, 1976).Google Scholar
  74. [74]
    R. Janicki, "Vectors of Coroutines over Blikle Nets", Fundamentals of Computation Theory, M. Karpinski (Ed.) {Lecture Notes in Computer Science, Vol.56}, pp.113–119 (Springer-Verlag, Berlin, 1977).Google Scholar
  75. [75]
    K. Jensen and N. Wirth, Pascal — User Manual and Report, Lecture Notes in Computer Science, Vol.18 (Springer-Verlag, Berlin, 1974).Google Scholar
  76. [76]
    C.W.Johnson, "The Run-Time Structure of Simula 67", Technical Report TR-CS-77-01, Computer Science Department, Australian National University, Canberra, Australian Capital Territory (February 1977).Google Scholar
  77. [77]
    C.W. Johnson, "References and/or Efficiency in High-Level Languages", Proc. Eighth Australian Computer Conference (1978), Vol.2, pp.772–788.Google Scholar
  78. [78]
    J.B. Johnston, "The Contour Model of Block Structured Processes", Proc. Symposium on Data Structures in Programming Languages, J.T.Tou and P.Wegner (Eds.) {A.C.M. SIGPLAN Notices, Vol.6, No.2 (February 1971)}, pp.55–82.Google Scholar
  79. [79]
    A.K. Jones, "The Narrowing Gap Between Language Systems and Operating Systems", Information Processing 77, B. Gilchrist (Ed.), pp.869–873 (North-Holland Pub. Co., Amsterdam, 1977).Google Scholar
  80. [80]
    A.K. Jones and B.H. Liskov, "A Language Extension for Expressing Constraints on Data Access", Comm. A.C.M., Vol.21, No.5 (May 1978), pp.358–367.Google Scholar
  81. [81]
    N.D. Jones and S.S. Muchnick, "TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Langauges", Lecture Notes in Computer Science, Vol.66 (Springer-Verlag, Berlin, 1978).Google Scholar
  82. [82]
    G. Kahn and D. MacQueen, "Coroutines and Networks of Parallel Processes", Information Processing 77, B. Gilchrist (Ed.), pp.993–998 (North Holland Pub. Co., Amsterdam, 1977).Google Scholar
  83. [83]
    R.B. Kieburtz, "Steps Toward Verifiable Programs", Technical Report No.12, Dept. of Computer Science, State University of New York at Stony Brook, Stony Brook, New York (November 1972).Google Scholar
  84. [84]
    C.H.A. Koster, "Visibility and Types", Proc. Conference on Data: Abstraction, Definition and Structure, {A.C.M. SIGPLAN Notices, Vol.11 (1976), Special Issue} pp.179–190.Google Scholar
  85. [85]
    D.E. Knuth, The Art of Computer Programming; Volume 1: Fundamental Algorithms (Addison-Wesley Pub. Co., Reading, Massachusetts, 1973).Google Scholar
  86. [86]
    B. Krieg, "A Class of Recursive Coroutines", Information Processing 74, J.L. Rosenfeld (Ed.), pp.408–412 (North Holland Pub. Co., Amsterdam, 1974).Google Scholar
  87. [87]
    B.W. Lampson, "Protection", Proc. Fifth Princeton Symposium on Information Sciences and Systems, Princeton University (March 1971), pp.437–443 {reprinted in A.C.M. Operating Systems Review, Vol.8, No.1 (January 1974), pp.18–24}.Google Scholar
  88. [88]
    B.W. Lampson, J.J. Horning, R.L. London, J.G. Mitchell and G.J. Popek, "Report on the Programming Language Euclid", A.C.M. SIGPLAN Notices, Vol.12, No.2 (February 1977), pp.1–79.Google Scholar
  89. [89]
    R.J.LeBlanc, Jr., "Specifications and Rationale for TELOS, a Pascal-based Artificial Intelligence Programming Language", Computer Sciences Technical Report No. 309, Computer Sciences Department {also: Madison Academic Computing Center Technical Report No. 49}, The University of Wisconsin, Madison, Wisconsin (December 1977).Google Scholar
  90. [90]
    R.J.LeBlanc, personal communication (12th March 1979).Google Scholar
  91. [91]
    M.J. Lemon, "Coroutine PASCAL: A Case Study in Separable Control", Technical Report No. 76-13, Dept. of Computer Science, University of Pittsburgh, Pittsburgh, Pennsylvania (December 1976).Google Scholar
  92. [92]
    M.J. Lemon, G. Lindstrom and M.L. Soffa, "Control Separation in Programming Languages", Proc. A.C.M. Annual Conference 1977, pp.496–501 (A.C.M., New York, 1977).Google Scholar
  93. [93]
    T.A. Linden, "Operating System Structures to Support Security and Reliable Software", Computing Surveys, Vol.8, No.4 (December 1976), pp.409–445.Google Scholar
  94. [94]
    G. Lindstrom, "Efficiency in Nondeterministic Control through Non-forgetful Backtracking", Technical Report No.UUCS-77-114, Department of Computer Science, University of Utah, Salt Lake City, Utah (October 1977).Google Scholar
  95. [95]
    G.Lindstrom, "Control Structure Aptness: A Case Study using Top-down Parsing", Proc. Third International Conference on Software Engineering, pp.5–12 (I.E.E.E., 1978).Google Scholar
  96. [96]
    G. Lindstrom, "Backtracking in a Generalized Control Setting", A.C.M. Trans. on Programming Languages and Systems, Vol.1, No.1 (July 1979), pp.8–26.Google Scholar
  97. [97]
    B. Liskov, A. Snyder, R. Atkinson and C. Schaffert, "Abstraction Mechanisms in CLU", Comm. A.C.M., Vol.20, No.8 (August 1977), pp.564–576.Google Scholar
  98. [98]
    B.H. Liskov and S.N. Zilles, "Specification Techniques for Data Abstractions", Proc. International Conference on Reliable Software 1975 {A.C.M. SIGPLAN Notices, Vol.10, No.6 (June 1975)}, pp.72–87 {also: I.E.E.E. Trans. on Software Engineering, Vol.SE-1, No.1 (March 1975), pp.7–19}.Google Scholar
  99. [99]
    E. Lynning, letter to the Editor, A.C.M. SIGPLAN Notices, Vol.13, No.2 (February 1978), pp.12–14.Google Scholar
  100. [100]
    C.D. Marlin, "An Experiment with the Extensibility of Simula", A.C.M. SIGPLAN Notices, Vol.11, No.11 (November 1976), pp.50–57.Google Scholar
  101. [101]
    C.D.Marlin, "A Model for Data Control in the Programming Language Pascal", Proc. Australian Colleges of Advanced Education Computing Conference, August 1977, A.K.Duncan (Ed.), pp.293–306 (South Australian Institute of Technology, Adelaide, South Australia, 1977).Google Scholar
  102. [102]
    C.D. Marlin, "The Design of the Sequence Control Aspect of a Coroutine Facility for a Procedural Programming Language", Proc. Eighth Australian Computer Conference (1978), Vol.3, pp.1267–1292 (Australian Computer Society Inc., 1978).Google Scholar
  103. [103]
    C.D. Marlin, "Coroutines and Return Addresses", letter to the Editor, A.C.M. SIGPLAN Notices, Vol.13, No.9 (September 1978), pp.19–20.Google Scholar
  104. [104]
    C.D. Marlin, "A Heap-based Implementation of the Programming Language Pascal", Software — Practice and Experience, Vol.9, No.2 (February 1979), pp.101–119.Google Scholar
  105. [105]
    J.R. McGraw, "Language Features for Process Interaction and Access Control", Technical Report No.77-319, Department of Computer Science, Cornell University, Ithaca, New York (August 1977).Google Scholar
  106. [106]
    M.D. McIlroy, "Coroutines", unpublished memo, Bell Telephone Laboratories, Murray Hill, New Jersey (May 1968).Google Scholar
  107. [107]
    L.F. Melli, "The 2.PAK Language: Primitives for A.I. Applications", Technical Report No. 73, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada (December 1974).Google Scholar
  108. [108]
    L.F.Melli, "The 2.PAK Language: Goals and Description", Proc. Fourth International Joint Conference on Artificial Intelligence (Tbilisi, U.S.S.R., September 1975), pp.549–555.Google Scholar
  109. [109]
    R. Milne and C. Strachey, "A Theory of Programming Language Semantics" (Chapman and Hall, London, 1976).Google Scholar
  110. [110]
    J.G. Mitchell and B. Wegbreit, "Schemes: A High Level Data Structuring Concept", Report No. CSL-77-1, Xerox Palo Alto Research Center, Palo Alto, California (January 1977).Google Scholar
  111. [111]
    J.B.Morris and M.B.Wells, "The Specification of Program Flow in Madcap 6", Control Structures in Programming Languages, B.M.Leavenworth (Ed.) {A.C.M. SIGPLAN Notices, Vol.7, No.11 (November 1972)}, pp.28–35.Google Scholar
  112. [112]
    P. Naur (Ed.), "Revised Report on the Algorithmic Language Algol 60", Comm. A.C.M., Vol.6, No.1 (January 1963), pp.1–17.Google Scholar
  113. [113]
    A.Newell and F.M.Tonge, "An Introduction to Information Processing Language V", The RAND Corporation Paper P-1929 {presented at the A.C.M. National Conference, Boston, Massachusetts, 1959} (The RAND Corporation, Santa Monica, California, 1960).Google Scholar
  114. [114]
    J.G. Noel, letter to the Editor, A.C.M. SIGPLAN Notices, Vol.12, No.12 (December 1977), p.23.Google Scholar
  115. [115]
    K.V.Nori, U.Ammann, K.Jensen, H.H.Nageli and Ch.Jacobi, "The Pascal<P> Compiler: Implementation Notes (Revised Edition)", Berichte Nr. 10, Institut für Informatik, Eidgenössische Technische Hochschule, Zürich (July 1976).Google Scholar
  116. [116]
    E.I. Organick, Computer System Organization — The B5700/B6700 Series (Academic Press, London, 1973).Google Scholar
  117. [117]
    J. Palme, "Protected Program Modules in Simula 67", FOA P Report C 8372-M3 (E5), Swedish National Defense Research Institute, Stockholm, Sweden (July 1973).Google Scholar
  118. [118]
    J. Palme, "Security and Programming Languages", FOA P Report C 8395-M3 (E5), Swedish National Defense Research Institute, Stockholm (April 1974).Google Scholar
  119. [119]
    D.L. Parnas, "A Technique for Software Module Specification with Examples", Comm. A.C.M., Vol.15, No.5 (May 1972), pp.330–336.Google Scholar
  120. [120]
    D.L. Parnas, "On the Criteria to be Used in Decomposing Systems into Modules", Comm. A.C.M., Vol.15, No.12 (Dec.1972), pp.1053–1058.Google Scholar
  121. [121]
    T.W. Pratt, Programming Languages: Design and Implementation (Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1975).Google Scholar
  122. [122]
    C.J.Prenner, "The Control Structure Facilities of ECL", Proc. International Symposium on Extensible Languages, S.A.Schuman (Ed.) {A.C.M. SIGPLAN Notices, Vol.6, No.12 (December 1971)}, pp.104–112.Google Scholar
  123. [123]
    P.A. Pritchard, "A Proof Rule for Multiple Coroutine Systems", Information Processing Letters, Vol.4, No.6 (March 1976), pp.141–143.Google Scholar
  124. [124]
    P.A. Pritchard, "On the Semantic Characterisation of Some Advanced Control Structures", Programming Language Systems, M.C. Newey, R.B. Stanton and G.L. Wolfendale (Eds.), pp.159–166 (Australian National University Press, Canberra, Australian Capital Territory, 1978).Google Scholar
  125. [125]
    P. Raulefs, "Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming Languages", Mathematical Foundations of Computer Science 1977, J. Gruska (Ed.) {Lecture Notes in Computer Science, Vol.53}, pp.451–459 (Springer-Verlag, Berlin, 1977).Google Scholar
  126. [126]
    J.F.Reiser (Ed.), "SAIL", Stanford A.I. Lab. Memo AIM-289 {also: Computer Science Department Report STAN-CS-76-574}, Stanford University, Stanford, California (August 1976).Google Scholar
  127. [127]
    J.C. Reynolds, "GEDANKEN — A Simple Typeless Language Based on the Principle of Completeness and the Reference Concept", Comm. A.C.M., Vol.13, No.5 (May 1970), pp.308–319.Google Scholar
  128. [128]
    M. Richards, "BCPL: A Tool for Compiler Writing and System Programming", Proc. Spring Joint Computer Conference 1969 {A.F.I.P.S. Conference Proceedings, Vol.34}, pp.557–566 (A.F.I.P.S. Press, Montvale, New Jersey, 1969).Google Scholar
  129. [129]
    G.D. Ripley, R.E. Griswold and D.R. Hanson, "Performance of Storage Management in an Implementation of SNOBOL4", I.E.E.E. Trans. on Software Engineering, Vol.SE-4, No.2 (March 1978), pp.130–137.Google Scholar
  130. [130]
    J. Sajaniemi, "The Safety of a Coroutine System", Automata, Languages and Programming, A. Salomaa and M. Steinby (Eds.) {Lecture Notes in Computer Science, Vol.52}, pp.440–452 (Springer-Verlag, Berlin, 1977).Google Scholar
  131. [131]
    A.H.J. Sale, "B6700/7700 PASCAL Reference Manual — Compiler Version II.8.002", Department of Information Science, The University of Tasmania, Hobart, Tasmania (July 1977).Google Scholar
  132. [132]
    S.E. Sevick, An Analysis of Uses of Coroutines, M.S. thesis, Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina (1976).Google Scholar
  133. [133]
    S.C. Shapiro and H.R. Smith, "A SCRABBLE Crossword Geme Playing Program", Technical Report 119, Department of Computer Science, State University of New York at Buffalo, Buffalo, New York (March 1977).Google Scholar
  134. [134]
    M. Shaw, W.A. Wulf and R.L. London, "Abstraction and Verification in Alphard: Defining and Specifying Iteration and Generators", Comm. A.C.M., Vol.20, No.8 (August 1977), pp.553–564.Google Scholar
  135. [135]
    H.A. Simon, "The Architecture of Complexity", Proc. American Philosophical Society, Vol.106, No.6 (December 1962), pp.467–482.Google Scholar
  136. [136]
    Simula Development Group, "The Detach and Call Statements", Recommendation No. 2 (September 1977).Google Scholar
  137. [137]
    E. Skordalakis and G. Papakonstantinou, "Coroutines in FORTRAN", A.C.M. SIGPLAN Notices, Vol.13, No.9 (September 1978), pp.76–84.Google Scholar
  138. [138]
    M.L. Soffa and G. Lindstrom, "Analytical Properties of Generalized Coroutines", Technical Report No. 76-10, Department of Computer Science, University of Pittsburgh, Pittsburgh, Pennsylvania (March 1977).Google Scholar
  139. [139]
    C.L. Smith, "A Formal Analysis of Name Accessing in Programming Languages", Ph.D. Dissertation, Iowa State University, Ames, Iowa (1975).Google Scholar
  140. [140]
    N.W. Smith, "SAIL Tutorial", A.I. Lab. Memo AIM-290 {also: Computer Science Department Report STAN-CS-76-575}, Stanford University, Stanford, California (October 1976).Google Scholar
  141. [141]
    W. Stallings, "An Application of Coroutines and Backtracking in Interactive Systems", Int. J. of Computer and Information Sciences, Vol.5, No.4 (December 1976), pp.303–313.Google Scholar
  142. [142]
    D.F. Stanat and D.F. McAllister, Discrete Mathematics in Computer Science (Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1977).Google Scholar
  143. [143]
    R.B. Stanton, "Programming Languages Matter", Proc. Seventh Australian Computer Conference (1976), Vol.3, pp.85–111 (Australian Computer Society Inc., 1976).Google Scholar
  144. [144]
    H.S. Stone and D.P. Siewiorek, Introduction to Computer Organization and Data Structures: PDP-11 Edition (McGraw-Hill Book Co., New York, 1975).Google Scholar
  145. [145]
    G.J. Sussman and D.V. McDermott, "From PLANNER to CONNIVER — A Genetic Approach", Proc. Fall Joint Computer Conference 1972 {A.F.I.P.S. Conference Proceedings, Vol.41}, Part II, pp.1171–1179 (A.F.I.P.S. Press, Montvale, New Jersey, 1972).Google Scholar
  146. [146]
    W. Teitelman, INTERLISP Reference Manual (Xerox Palo Alto Research Center, Palo Alto, California, 1975).Google Scholar
  147. [147]
    R.D. Tennent, "PASQUAL: A Proposed Generalization of Pascal", Technical Report No.75-32, Queen's University, Kingston, Ontario (February 1975).Google Scholar
  148. [148]
    L.Travis, M.Honda, R.LeBlanc and S.Zeigler, "Design Rationale for TELOS, a Pascal-based A.I. Language", Proc. Symposium on Artificial Intelligence and Programming Languages {A.C.M. SIGPLAN Notices, Vol.12, No.8 (August 1977) and A.C.M. SIGART Newsletter, No.64 (August 1977)}, pp.67–76.Google Scholar
  149. [149]
    L.I. Vanek, "Hierarchical Coroutines: A Mechanism for Improved Program Structure", Technical Report No.99, Computer Systems Research Group, University of Toronto, Toronto, Ontario (February 1979).Google Scholar
  150. [150]
    A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck, C.H.A. Koster, M. Sintzoff, C.H. Lindsey, L.G.L.T. Meertens and R.G. Fisker (Eds.), "Revised Report on the Algorithmic Language ALGOL 68", A.C.M. SIGPLAN Notices, Vol.12, No.5 (May 1977), pp.1–70 {also: Acta Informatica, Vol.5 (1975), pp.1–236}.Google Scholar
  151. [151]
    T. Venema and J. des Rivieres, "Euclid and Pascal", A.C.M. SIGPLAN Notices, Vol.13, No.3 (March 1978), pp.57–69.Google Scholar
  152. [152]
    A. Wang and O.-J. Dahl, "Coroutine Sequencing in a Block Structured Environment", B.I.T., Vol.11 (1971), pp.425–449.Google Scholar
  153. [153]
    S.K. Warren, The Coroutine Model of Attribute Grammar Evaluation, Ph.D. thesis, Rice University, Houston, Texas (April 1976).Google Scholar
  154. [154]
    D.A. Watt, "An Extended Attribute Grammar for Pascal", A.C.M. SIGPLAN Notices, Vol.14, No.2 (February 1979), pp.60–74.Google Scholar
  155. [155]
    P.Wegner, "Data Structure Models for Programming Languages", Proc. Symposium on Data Structures in Programming Languages, J.T.Tou and P.Wegner (Eds.) {A.C.M. SIGPLAN Notices, Vol.6, No.2 (February 1971)}, pp.1–54.Google Scholar
  156. [156]
    J. Welsh, W.J. Sneeringer and C.A.R. Hoare, "Ambiguities and Insecurities in Pascal", Software — Practice and Experience, Vol.7, No.6 (November-December 1977), pp.685–696.Google Scholar
  157. [157]
    T.R. Wilcox, "ASPEN Language SpecificAtions", A.C.M. SIGPLAN Notices, Vol.12, No.11 (November 1977), pp.70–87.Google Scholar
  158. [158]
    N. Wirth, "The Programming Language Pascal", Acta Informatica, Vol.1, Fasc.1 (1971), pp.35–63.Google Scholar
  159. [159]
    N. Wirth, "Program Development by Stepwise Refinement", Comm. A.C.M., Vol.14, No.4 (April 1971), pp.221–227.Google Scholar
  160. [160]
    N. Wirth, "The Programming Language Pascal and its Design Criteria", Infotech State of the Art Report No. 7, pp.453–473 (Infotech Information Ltd., Maidenhead, England, 1972).Google Scholar
  161. [161]
    N. Wirth, Systematic Programming — An Introduction (Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1973).Google Scholar
  162. [162]
    N. Wirth, "On the Design of Programming Languages", Information Processing 74, J.L. Rosenfeld (Ed.), pp.386–393 (North Holland Pub. Co., Amsterdam, 1974).Google Scholar
  163. [163]
    N. Wirth, "Programming Languages: What to Demand and How to Assess Them", Software Engineering, R.H. Perrot (Ed.) {A.P.I.C. Studies in Data Processing, No. 14}, pp.155–173 (Academic Press, London, 1977).Google Scholar
  164. [164]
    W.A. Wulf, R.L. London and M. Shaw, "An Introduction to the Construction and Verification of Alphard Programs", I.E.E.E. Trans. on Software Engineering, Vol.SE-2, No.2 (December 1976), pp.253–265.Google Scholar
  165. [165]
    W. Wulf, D.B. Russell and A.N. Habermann, "BLISS: A Language for Systems Programming", Comm. A.C.M., Vol.14, No.12 (December 1971), pp.780–790.Google Scholar
  166. [166]
    W. Wulf and M. Shaw, "Global Variable Considered Harmful", A.C.M. SIGPLAN Notices, Vol.8, No.2 (February 1973), pp.28–34.Google Scholar
  167. [167]
    M.V. Zelkowitz and H.J. Larsen, "Implementation of a Capability-Based Data Abstraction", I.E.E.E. Trans. on Software Engineering, Vol.SE-4, No.1 (January 1978), pp.56–64.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Personalised recommendations