%A Malcom P. Atkinson
%A Ronald Morrison
%T Procedures as persistent data objects
%J TOPLAS
%V 7
%N 4
%P 539-559
%D OCT 1985
%K persistent programming, first class procedures
%A Mahadevan Ganapathi
%A Charles N. Fischer
%T Affix grammar driven code generation
%J TOPLAS
%V 7
%N 4
%P 560-599
%D OCT 1985
%K code generation, code-generator-generator, code optimization,
compiler compiler, intermediate representation, machine-dependent optimization,
machine description
%A Robert P. Nix
%T Editing by example
%J TOPLAS
%V 7
%N 4
%P 600-621
%D OCT 1985
%K Automatic programming, gap patterns, grammatical inference,
inductive inference, text editing
%A Nissim Francez
%A Shaula A. Yemini
%T Symmetric intertask communication
%J TOPLAS
%V 7
%N 4
%P 622-636
%D OCT 1985
%K Ada, guards, inverted communication, rendezvous, semantics
%A Hans-Juergen Boehm
%T Side effects and aliasing can have simple axiomatic descriptions
%J TOPLAS
%V 7
%N 4
%P 637-655
%D OCT 1985
%K Algol-68, aliasing, completeness, expression language, LISP, side effect
%A Arie de Bruin
%A Wim Boehm
%T The denotational semantics of dynamic networks of processes
%J TOPLAS
%V 7
%N 4
%P 656-679
%D OCT 1985
%K continuation semantics, denotational semantics, parallel coroutines,
parallelism, recursively defined processes
--
Jon Mauney, mcnc!ncsu!mauney North Carolina State University