%A J.C. Bays
%T An animation description language
%D 1976
%J Computer Languages
%K complang
%V 2
%N 1/2
%P 1-8

%A R.G. Herriot
%T Structured syntax diagrams
%D 1976
%J Computer Languages
%K complang
%V 2
%N 1/2
%P 9-20

%A J.T. Schwartz
%T What programmers should know
%D 1976
%J Computer Languages
%K complang
%V 2
%N 1/2
%P 21-26

%A H.K. Huang
%A R.S. Ledley
%A P. Johnson
%T DILOG: Digitaled Intelligence Logic machine
%D 1976
%J Computer Languages
%K complang
%V 2
%N 1/2
%P 27-44

%A Harry J. Saal
%A Zvi Weiss
%T An empirical study of APL programs
%D 1977
%J Computer Languages
%K complang
%V 2
%N 3
%P 47-60

%A Dennis J. McLeod
%T High level definition of abstract domains in a relational database system
%D 1977
%J Computer Languages
%K complang
%V 2
%N 3
%P 61-74

%A Glen E. Newton
%A J. Denbigh Starkey
%T SESPOOL, a language for systems programming
%D 1977
%J Computer Languages
%K complang
%V 2
%N 3
%P 75-92

%A Narain Gehani
%T Units of measure as a data attribute
%D 1977
%J Computer Languages
%K complang
%V 2
%N 3
%P 93-112

%A James E. White
%T Elements of a distributed programming system
%D 1977
%J Computer Languages
%K complang
%V 2
%N 4
%P 117-134

%A D.M. Berry
%A Z. Erlich
%A C.J. Lucena
%T Pointers and data abstractions in high level languages -
I: language problems
%D 1977
%J Computer Languages
%K complang
%V 2
%N 4
%P 135-148

%A D.M. Berry
%T Pointers and data abstractions in high level languages -
II: correctness proofs
%D 1977
%J Computer Languages
%K complang
%V 2
%N 4
%P 149-170

%A Alan L. Tharp
%T A comparison of Cobol, Fortran, PL-I and Spitbol
%D 1977
%J Computer Languages
%K complang
%V 2
%N 4
%P 171-178

%A Charles Wetherell
%T Why automatic error correctors fail
%D 1977
%J Computer Languages
%K complang
%V 2
%N 4
%P 179-186

%A Norman D. Peterson
%T Elements of style among machine-generated COBOL flowcharts
%D 1978
%J Computer Languages
%K complang
%V 3
%N 1
%P 1-12

%A F.G. Pagan
%T Formal semantics of a SNOBOL4 subset
%D 1978
%J Computer Languages
%K complang
%V 3
%N 1
%P 13-30

%A Daniel P. Friedman
%A Davis S. Wise
%T Functional combination
%D 1978
%J Computer Languages
%K complang
%V 3
%N 1
%P 31-36

%A A.C. Fleck
%T Recent developments in the theory of data structures
%D 1978
%J Computer Languages
%K complang
%V 3
%N 1
%P 37-52

%A Tsyh Wen Pao
%A John W. Carr,\ III
%T A solution of the syntactical induction-inference problem
for regular languages
%D 1978
%J Computer Languages
%K complang
%V 3
%N 1
%P 53-64

%A P.B. Barroso
%A A.L. Furtado
%T Implementing a data definition facility driven by graph grammars
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 65-74

%A Richard L. Schwartz
%T Parallel compilation: a design and its application to SIMULA 67
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 75-94

%A Ivan Flores
%T Making macrospaces effective
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 95-114

%A Henry S. Warren,\ Jr.
%T Three simple node list algorithms
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 115-126

%A Glenn K. Manacher
%T An improved version of the Cocke-Younger-Kasami algorithm
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 127-134

%A Lawrence Yelowitz
%A Arthur G. Duncan
%T Data structures and program correctness: bridging the gap
%D 1978
%J Computer Languages
%K complang
%V 3
%N 2
%P 135-142

%A Milos Konopasek
%A Christos Papaconstadopoulos
%T The question answering system on mathematical models (QAS):
description of the language
%D 1978
%J Computer Languages
%K complang
%V 3
%N 3
%P 145-156

%A Sergio E.R. Carvalho
%T A proposal for a generalized "FOR" statement
%D 1978
%J Computer Languages
%K complang
%V 3
%N 3
%P 157-162

%A Ken Kennedy
%T Use-definition chains with applications
%D 1978
%J Computer Languages
%K complang
%V 3
%N 3
%P 163-180

%A David R. Hanson
%T Data structures in SL5
%D 1978
%J Computer Languages
%K complang
%V 3
%N 3
%P 181-192

%A Wolfgang Bachmann
%A Herward Schwarze
%T SOLMAR - a computer language for utilizing sonar models
%D 1978
%J Computer Languages
%K complang
%V 3
%N 3
%P 193-202

%A A. Toni Cohen
%A Leon S. Levy
%T Structured flowcharts for multiprocessing
%D 1978
%J Computer Languages
%K complang
%V 3
%N 4
%P 209-226

%A G. David Ripley
%A Frederick C. Druseikis
%T A statistical analysis of syntax errors
%D 1978
%J Computer Languages
%K complang
%V 3
%N 4
%P 227-240

%A Mitchell Wand
%A Daniel P. Friedman
%T Compiling lambda-expressions using continuations and factorizations
%D 1978
%J Computer Languages
%K complang
%V 3
%N 4
%P 241-264

%A Samuel H. Joselhoff
%T Copyright protection for computer programs and other computer readable works
%D 1978
%J Computer Languages
%K complang
%V 3
%N 4
%P 265-266

%A Richard L. Schwartz
%A Daniel M. Berry
%T A semantic view of ALGOL 68
%D 1979
%J Computer Languages
%K complang
%V 4
%N 1
%P 1-16

%A Hiroyasu Nagata
%T EQL: a language for numerical computation
%D 1979
%J Computer Languages
%K complang
%V 4
%N 1
%P 17-28

%A William E. Riddle
%T An approach to software system behaviour description
%D 1979
%J Computer Languages
%K complang
%V 4
%N 1
%P 29-48

%A William E. Riddle
%T An approach to software system modeling and analysis
%D 1979
%J Computer Languages
%K complang
%V 4
%N 1
%P 49-66

%A Charles Crowley
%T Parallel developments in programming languages and operating systems
%D 1979
%J Computer Languages
%K complang
%V 4
%N 2
%P 71-82

%A S.M. Chou
%A K.S. Fu
%T Inference for transition network grammars
%D 1979
%J Computer Languages
%K complang
%V 4
%N 2
%P 83-92

%A Narain Gehani
%T A high level data structure - the grid
%D 1979
%J Computer Languages
%K complang
%V 4
%N 2
%P 93-98

%A John Spragins
%T Approximate techniques for modeling the performance of complex systems
%D 1979
%J Computer Languages
%K complang
%V 4
%N 2
%P 99-129

%A Kou-Chung Tai
%T Constant folding within an expression by semantic attributes
%D 1979
%J Computer Languages
%K complang
%V 4
%N 3/4
%P 131-138

%A Gerd Schiffner
%A Peter Scheuerman
%T Multiple views and abstractions with an Extended-Entity-Relationship model
%D 1979
%J Computer Languages
%K complang
%V 4
%N 3/4
%P 139-154

%A Anthony I. Wasserman
%T Testing and verification aspects of Pascal-like languages
%D 1979
%J Computer Languages
%K complang
%V 4
%N 3/4
%P 155-170

%A Frank G. Pagan
%T Semantic specification using two-level grammars:
blocks, procedures and parameters
%D 1979
%J Computer Languages
%K complang
%V 4
%N 3/4
%P 171-186

%A Hana Samet
%T Deep and shallow binding: the assignment operation
%D 1979
%J Computer Languages
%K complang
%V 4
%N 3/4
%P 187-198

%A Robert P. Rich
%T Mechanical proof testing
%D 1980
%J Computer Languages
%K complang
%V 5
%N 1
%P 1-28

%A John H. Crawford
%A Mehdi Jazayeri
%T A new approach to code motion and its implications to hoisting
%D 1980
%J Computer Languages
%K complang
%V 5
%N 1
%P 29-36

%A M.H. Williams
%T A formal notation for specifying static semantic rules
%D 1980
%J Computer Languages
%K complang
%V 5
%N 1
%P 37-56

%A Hiroyasu Nagata
%T FORMAL: a language with a macro-oriented expansion facility
%D 1980
%J Computer Languages
%K complang
%V 5
%N 2
%P 65-76

%A D.M. Berry
%A R.A. Kemmerer
%A A. von\ Staa
%A S. Yemini
%T Toward modular verifyable exception handling
%D 1980
%J Computer Languages
%K complang
%V 5
%N 2
%P 77-102

%A Augusto Celentano
%A Pierluigi Della Vigna
%A Carlo Ghezzi
%A Dino Mandroli
%T SIMPLE: a program development system
%D 1980
%J Computer Languages
%K complang
%V 5
%N 2
%P 103-114

%A Aspi B. Wadia
%T Generation of node lists using segment analysis
%D 1980
%J Computer Languages
%K complang
%V 5
%N 2
%P 115-129

%A C.N. Fisher
%A J. Mauney
%T On the role of error productions in syntactic error correction
%D 1980
%J Computer Languages
%K complang
%V 5
%N 3/4
%P 131-140

%A M. Sharir
%T Structural analysis: a new approach to flow analysis
in optimizing compilers
%D 1980
%J Computer Languages
%K complang
%V 5
%N 3/4
%P 141-154

%A Narain Gehani
%T Generic procedures: an implementation and an undecidability result
%D 1980
%J Computer Languages
%K complang
%V 5
%N 3/4
%P 155-162

%A Richard M. Salter
%A Terence J. Brennan
%A Daniel P. Friedman
%T CONCUR: a language for continuous, concurrent processes
%D 1980
%J Computer Languages
%K complang
%V 5
%N 3/4
%P 163-190

%A M.H. Williams
%T Methods for specifying static semantics
%D 1981
%J Computer Languages
%K complang
%V 6
%N 1
%P 1-18

%A M.T. Lepage
%A D.T. Barnard
%A A. Rudmik
%T Optimization of hierarchical directed graphs
%D 1981
%J Computer Languages
%K complang
%V 6
%N 1
%P 19-34

%A Micha Sharir
%T Formal integration: a program transformation technique
%D 1981
%J Computer Languages
%K complang
%V 6
%N 1
%P 35-46

%A Gregory J. Chaitin
%A Marc A. Auslander
%A Ashok K. Chandra
%A John Cocke
%A Martin E. Hopkins
%A Peter W. Markstein
%T Register allocation via coloring
%D 1981
%J Computer Languages
%K complang
%V 6
%N 1
%P 47-58

%A M.P. Georgeff
%A I. Fris
%A J. Kautsky
%T The effect of operators on parsing and evaluation in APL
%D 1981
%J Computer Languages
%K complang
%V 6
%N 2
%P 67-78

%A Mark Scott Johnson
%T Dispel: a run-time debugging language
%D 1981
%J Computer Languages
%K complang
%V 6
%N 2
%P 79-94

%A Augusto Celentano
%T An LR parsing technique for extended context-free grammars
%D 1981
%J Computer Languages
%K complang
%V 6
%N 2
%P 95-108

%A Augusto Celentano
%A Pierluigi Della Vigna
%T Interprocedural test path evaluation
%D 1981
%J Computer Languages
%K complang
%V 6
%N 3/4
%P 115-130

%A Robert P. Cook
%T Abstractions for distributed programming
%D 1981
%J Computer Languages
%K complang
%V 6
%N 3/4
%P 131-138

%A Marvin V. Zelkowitz
%A James R. Lyle
%T Implementation of language enhancements
%D 1981
%J Computer Languages
%K complang
%V 6
%N 3/4
%P 139-154

%A Jong-Chuang Tsay
%A Yu-Ming Chang
%T Design and implementation of a Chinese terminal controller
%D 1981
%J Computer Languages
%K complang
%V 6
%N 3/4
%P 155-164

%A Giuseppa C. Gini
%A Maria L. Gini
%T Interactive development of object handling programs
%D 1982
%J Computer Languages
%K complang
%V 7
%N 1
%P 1-10

%A D.M. Berry
%A C. Ghezzi
%A D. Mandrioli
%A F. Tisato
%T Language constructs for real-time distributed systems
%D 1982
%J Computer Languages
%K complang
%V 7
%N 1
%P 11-20

%A N.H. Gehani
%T Concurrency in Ada and multicomputers
%D 1982
%J Computer Languages
%K complang
%V 7
%N 1
%P 21-24

%A Harold Thimbleby
%T A text editing interface: definition and use
%D 1982
%J Computer Languages
%K complang
%V 7
%N 1
%P 25-40

%A M.V.S. Ramanath
%A Marvin Solomon
%T Optimal code from flow graphs
%D 1982
%J Computer Languages
%K complang
%V 7
%N 1
%P 41-52

%A Jan Messeschmidt
%A Reinhard Wilhelm
%T Constructors for composed objects
%D 1982
%J Computer Languages
%K complang
%V 7
%N 2
%P 53-60

%A Thomas R. Virgilio
%A Raphael Finkel
%T Binding strategies and scope rules are independent
%D 1982
%J Computer Languages
%K complang
%V 7
%N 2
%P 61-68

%A Timothy A. Budd
%T An implementation of generators in C
%D 1982
%J Computer Languages
%K complang
%V 7
%N 2
%P 69-88

%A N. Cocco
%A S. Dulli
%T A mechanism for exception handling and its verification rules
%D 1982
%J Computer Languages
%K complang
%V 7
%N 2
%P 89-102

%A Nancy H. McDonald
%A John P. McNally
%T Query language feature analysis by usability
%D 1982
%J Computer Languages
%K complang
%V 7
%N 3/4
%P 103-124

%A Mervyn Barman
%T LASS: a language for stochastic systems
%D 1982
%J Computer Languages
%K complang
%V 7
%N 3/4
%P 125-146

%A S. Sitharama Iyengar
%A N. Parameswaran
%A John Fuller
%T A measure of logical complexity of programs
%D 1982
%J Computer Languages
%K complang
%V 7
%N 3/4
%P 147-160

%A Nadia Magnenat-Thalmann
%T Choosing an implementation language for automatic translation
%D 1982
%J Computer Languages
%K complang
%V 7
%N 3/4
%P 161-170

%A Stephen B. Wampler
%A Ralph E. Griswold
%T Result sequences
%D 1983
%J Computer Languages
%K complang
%V 8
%N 1
%P 1-14

%A Lawrence A. Coon
%A John P. Kearns
%A Mary Lou Soffa
%T The contraction of control implementations
%D 1983
%J Computer Languages
%K complang
%V 8
%N 1
%P 15-26

%A Peter M. Mauer
%A Arthur E. Oldehoeft
%T The use of combinators in translating a purely functional language
to low-level data-flow graphs
%D 1983
%J Computer Languages
%K complang
%V 8
%N 1
%P 27-46

%A W.C. Yen
%A K.S. Fu
%T A distributed synchronization mechanism for interacting processes
%D 1983
%J Computer Languages
%K complang
%V 8
%N 2
%P 51-60

%A Richard Salter
%T Concurrent applicative implementations of nondeterminism algorithms
%D 1983
%J Computer Languages
%K complang
%V 8
%N 2
%P 61-68

%A D.M. Dhamdhere
%A J.S. Keith
%T Characterization of program loops in code optimization
%D 1983
%J Computer Languages
%K complang
%V 8
%N 2
%P 69-76

%A Ralph E. Griswold
%T Implementing SNOBOL4 pattern matching in Icon
%D 1983
%J Computer Languages
%K complang
%V 8
%N 2
%P 77-92

%A P.R.F. Cunha
%A C.J. Lucena
%A T.S.E. Maibaum
%T Message oriented programming - a resource based methodology
%D 1983
%J Computer Languages
%K complang
%V 8
%N 3/4
%P 95-112

%A Levent Orman
%T A familial specification language for database application systems
%D 1983
%J Computer Languages
%K complang
%V 8
%N 3/4
%P 113-124

%A R.D. Tennent
%T Some proposals for improving Pascal
%D 1983
%J Computer Languages
%K complang
%V 8
%N 3/4
%P 125-138

%A J. Ramanathan
%A D. Soni
%T Design and implementation of an adaptable software environment
%D 1983
%J Computer Languages
%K complang
%V 8
%N 3/4
%P 139-160

%A Marco Colombetti
%A Giovanni Guida
%T Supporting control definition in programming languages
%D 1984
%J Computer Languages
%K complang
%V 9
%N 1
%P 1-24

%A Annalisa Bossi
%A Carlo Ghezzi
%T Using FP as a query language for relational databases
%D 1984
%J Computer Languages
%K complang
%V 9
%N 1
%P 25-38

%A Yoshihisa Mano
%A Kazuhito Ohmaki
%A Koji Tori
%T A new programming environment with a multi-display terminal
and early experiences with it
%D 1984
%J Computer Languages
%K complang
%V 9
%N 1
%P 39-50

%A K. Hammond
%A V.J. Rayward-Smith
%T A survey on syntactic error recovery and repair
%D 1984
%J Computer Languages
%K complang
%V 9
%N 1
%P 51-68

%A A.C. Fleck
%T A proposal for comparison of types
in Pascal and associated semantic models
%D 1984
%J Computer Languages
%K complang
%V 9
%N 2
%P 71-88

%A Alan Reed
%T Anatomy of a text analysis package
%D 1984
%J Computer Languages
%K complang
%V 9
%N 2
%P 89-96

%A L.M. Patnaik
%A Prabal Bhattacharya
%A R. Ganesh
%T DFL: a data flow language
%D 1984
%J Computer Languages
%K complang
%V 9
%N 2
%P 97-106

%A M.P. Papazoglou
%A P.I. Georgiadis
%A D.G. Maritsas
%T An outline of the programming language SIMULA
%D 1984
%J Computer Languages
%K complang
%V 9
%N 2
%P 107-131

%A Steven C. Cater
%A S. Sitharama Iyengar
%A John Fuller
%T Computation of logical effort in high level languages
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 133-148

%A Barrett R. Bryant
%A A.A. Grau
%T An intermediate language to define dynamic semantics
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 149-160

%A Sergei Nirenburg
%A Yosef Ben Asher
%T HUHU: the Hebrew University Hebrew Understander
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 161-182

%A Fernando Lafora
%A Mary Lou Soffa
%T Reverse execution in a generalized control regime
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 183-192

%A L.M. Patnaik
%A B.R. Badrinath
%T Implementation of CSP-S for description of distributed algorithms
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 193-202

%A Franz Stetter
%T A measure of program complexity
%D 1984
%J Computer Languages
%K complang
%V 9
%N 3/4
%P 203-208

%A Richard B. Kieburtz
%A Bengt Nordstrom
%T The design of Apple - a language for modular programs
%D 1985
%J Computer Languages
%K complang
%V 10
%N 1
%P 1-22

%A Herman D. Hughes
%T A programming language engineered for beginners
%D 1985
%J Computer Languages
%K complang
%V 10
%N 1
%P 23-36

%A Mark Weiser
%T Experience with a dataflow datatype
%D 1985
%J Computer Languages
%K complang
%V 10
%N 1
%P 37-42

%A D. Mandrioli
%A R. Zicari
%A C. Ghezzi
%A F. Tisato
%T Modeling the Ada task system by Petri nets
%D 1985
%J Computer Languages
%K complang
%V 10
%N 1
%P 43-62

%A Timothy A. Budd
%A Ajei S. Gopal
%T Program testing by specification mutation
%D 1985
%J Computer Languages
%K complang
%V 10
%N 1
%P 63-73

%A D.M. Symes
%T Procedural operators considered as fundamental programming devices
%D 1985
%J Computer Languages
%K complang
%V 10
%N 2
%P 75-90

%A S. Matwin
%A T. Pietrzykowski
%T PROGRAPH: a preliminary report
%D 1985
%J Computer Languages
%K complang
%V 10
%N 2
%P 91-126

%A M. Zaki
%A S.A. Gamal-Eldin
%T A portable syntax analyzer for microcomputers
%D 1985
%J Computer Languages
%K complang
%V 10
%N 2
%P 127-146

%A Shahrzade Mazaher
%A Daniel M. Berry
%T Deriving a compiler from an operational semantics written in VDL
%D 1985
%J Computer Languages
%K complang
%V 10
%N 2
%P 147-164

%A L.M. Patnaik
%A D.M. Chowdhary
%T Generalized query-by-rule: a heterogeneous database query language
%D 1985
%J Computer Languages
%K complang
%V 10
%N 3/4
%P 165-178

%A S.I. Ahson
%A S.S. Lamba
%T The use of Forth language in process control
%D 1985
%J Computer Languages
%K complang
%V 10
%N 3/4
%P 179-188

%A N. Cocco
%A D. Mandrioli
%A V. Milanese
%T The Ada task system and real-rime applications:
an implementation schema
%D 1985
%J Computer Languages
%K complang
%V 10
%N 3/4
%P 189-210

%A M.S. Joy
%A V.J. Rayward-Smith
%A F.W. Burton
%T Efficient combinator code
%D 1985
%J Computer Languages
%K complang
%V 10
%N 3/4
%P 211-224

%A Robert E. Noonan
%T An algorithm for generating abstract syntax trees
%D 1985
%J Computer Languages
%K complang
%V 10
%N 3/4
%P 225-236

%A Vijay Gehlot
%A Y.N. Srikant
%T An inetrpreter for SLIPS -
an applicative language based on LAMBDA-calculus
%J Computer Languages
%K complang
%V 11
%N 1
%D 1986
%P 1-13

%A Pamela Zave
%T Case study: the PAISley approach applied to its own software tools
%J Computer Languages
%K complang
%V 11
%N 1
%D 1986
%P 15-28

%A Matthias Felleisen
%A Daniel P. Friedman
%T A closer look at export and import statements
%J Computer Languages
%K complang
%V 11
%N 1
%D 1986
%P 29-37

%A Eliezer L. Lozinskii
%A Sergei Nirenburg
%T Parsing in parallel
%J Computer Languages
%K complang
%V 11
%N 1
%D 1986
%P 39-51

%A Paul A. Bailes
%T Static checking of variable handling in Dijkstra's guarded commands language
%J Computer Languages
%K complang
%V 11
%N 2/3
%D 1986
%P 123-142

%A Christopher T. Haynes
%A Daniel P. Friedman
%A Mitchell Wand
%T Obtaining coroutines with continuations
%J Computer Languages
%K complang
%V 11
%N 2/3
%D 1986
%P 143-153

%A G. Donnan
%A M. Elizabeth C. Hull
%T On processes, synchronization and redundant code
in communicating sequential processes
%J Computer Languages
%K complang
%V 11
%N 2/3
%D 1986
%P 155-160

%A Kent Petersson
%A Jan M. Smith
%T Program derivation in type theory: a partitioning problem
%J Computer Languages
%K complang
%V 11
%N 2/3
%D 1986
%P 161-172

%A Barret R. Bryant
%A Balanjaninath Edupuganty
%A Lee S. Hull
%T Two-level grammar as an implementable metalanguage for axiomatic semantics
%J Computer Languages
%K complang
%V 11
%N 2/3
%D 1986
%P 173-191

%A Michael C. Rubenstein
%A Richard M. Salter
%T Computationally extended logic programming
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 1-7

%A Koji Torii
%A Yuji Sugiyama
%A Mamoru Fujii
%A Tadao Kasami
%A Yoshitomo Morisawa
%T Logical programming for the telegram analysis problem
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 9-20

%A John D. Gannon
%A Marvin V. Zelkowitz
%T Two implementation models of abstract data types
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 21-25

%A M. Elizabeth C. Hull
%T Occam - a programming language for multiprocessor systems
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 27-37

%A James W. Hooper
%T Language features for discrete simulation
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 39-46

%A Marc Feeley
%A Guy Lapalme
%T Using closures for code generation
%J Computer Languages
%K complang
%V 12
%N 1
%D 1987
%P 47-66

%A Paul A. Bailes
%T G: a functional language with generic abstract data types
%J Computer Languages
%K complang
%V 12
%N 2
%D 1987
%P 69-94

%A Thomas W. Strothotte
%A Gordon V. Cormack
%T Structured program lookahead
%J Computer Languages
%K complang
%V 12
%N 2
%D 1987
%P 95-108

%A Christopher T. Haynes
%A Daniel P. Friedman
%T Abstracting timed preemption with engines
%J Computer Languages
%K complang
%V 12
%N 2
%D 1987
%P 109-121

%A M. Zaki
%A Al.H. Albarhamtoshy
%T A formal design of an Arabic text formatter for microcomputers
%J Computer Languages
%K complang
%V 12
%N 2
%D 1987
%P 123-143