The Computer Journal, Volume 32, 1989

Volume 32, Number 1, 1989

T. H. Tse, L. Pong:
Towards a Formal Foundation for DeMarco Data Flow Diagrams. 1-12
Chris J. Mitchell:
Multi-Destination Secure Electronic Mail. 13-15
Timothy C. Bell, Alistair Moffat:
A Note on the DMC Data Compression Scheme. 16-20
Sharam Hekmatpour:
A Window Manager for UNIX. 21-23
Bernd Freisleben, James Leslie Keedy:
Priority Semaphores. 24-28
Paolo Corsini, Graziano Frosini, G. Speranza:
The Parallel Interpretation of Logic Programs in Distributed Architectures. 29-35
Balanjaninath Edupuganty, Barrett R. Bryant:
Two-Level Grammar as a Functional Programming Language. 36-44
Ivor P. Page, R. T. Jacob:
The Solution of Mutual Exclusion Problems which can be Described Graphically. 45-54
N. Parimala, Naveen Prakash, B. L. N. Rao, Narasimha Bolloju:
A Query Facility to a Network DBMS. 55-62
A. Hutchinson:
Inheritance and Kinds of Slots. 63-67
Joseph C. Culberson, J. Ian Munro:
Explaining the Behaviour of Binary Search Trees Under Prolonged Updates: A Model and Simulations. 68-75
M. C. Er:
Classes of Admissible Permutations that are Generatable by Depth-First Traversals of Ordered Trees. 76-85
Alan R. Halbert, Stephen Todd, John R. Woodwark:
Generalizing Active Zones for Set-Theoretic Solid Models. 86-89

Short Notes

Mauro Negri, Giuseppe Pelagatti, Licia Sbattella:
Semantics and Probelms of Universal Quantification in SQL. 90-91
Martha Sideri, Sophocles Efremidis, G. Papaconstantinou:
Semantically Driven Parsing of Context-Free Languages. 91-93
M. J. Jamieson:
Rapidly Converging Iterative Formulae for Finding Square Roots and Their Computational Efficiencies. 93-94

John Hughes:
Why Functional Programming Matters. 98-107
R. Frost, John Launchbury:
Constructing Natural Language Interpreters in a Lazy Functional Language. 108-121
Richard S. Bird:
Algebraic Identities for Program Calculation. 122-126
Lennart Augustsson, Thomas Johnsson:
The Chalmers Lazy-ML Compiler. 127-141
Stuart Wray, Jon Fairbairn:
Non-Strict Languages - Programming and Implementation. 142-151
Adrienne Bloss, Paul Hudak, Jonathan Young:
An Optimising Compiler for a Modern Functional Language. 152-161
S. B. Jones, A. F. Sinclair:
Functional Programming and Operating Systems. 162-174
Simon L. Peyton Jones:
Parallel Implementations of Functional Programming Languages. 175-186

Short Note

K. P. Tan, T. S. Chua, P. T. Lee:
AUTO-DFD: An Intelligent Data Flow Processor. 194-201
Anthony N. Godwin, M. B. Gore, D. W. Salt:
A Comparison of JSD and DFD as Descriptive Tools. 202-211
Michael A. Shepherd, William J. Phillips, C.-K. Chu:
A Fixed-Size Bloom Filter for Searching Textual Documents. 212-219
Abdelmoula El-Hamdouchi, Peter Willett:
Comparison of Hierarchie Agglomerative Clustering Methods for Document Retrieval. 220-227
Jyrki Katajainen, Timo Raita:
An Approximation Algorithm for Space-Optimal Encoding of a Text. 228-237
Erkki Mäkinen:
On Implementing Two Adaptive Data-Compression Schemes. 238-240
K. W. Yu, Tong Lai Yu:
Data Encryption Based Upon Time Reversal Transformations. 241-245
M. Rahman, S. Misbahuddin:
Effect of a Binary Symmetric Channel on the Synchronisations Recovery of Variable Length Codes. 246-251
L. H. Ngoh, T. P. Hopkins:
Transport Protocol Requirements for Distributed Multimedia Information Systems. 252-261
G. G. Scarrott:
The Nature of Information. 262-266
André Schiper, Roland Simon, Philippe Desarzens, Jacques-André Sengstag:
Efficient Implementation of Rendezvous. 267-272
J. M. Wilson:
Crossword Compilation Using Integer Programming. 273-275
Hal Berghel, C. Yi:
Crossword Compiler-Compilation. 276-280

Short Note

Borivoje Djokic, Masahiro Miyakawa, Satoshi Sekiguchi, Ichiro Semba, Ivan Stojmenovic:
A Fast Iterative Algorithm for Generating Set Partitions. 281-282

Phillip M. Yelland:
First Steps Towards Fully Abstract Semantics for Object-Oriented Languages. 290-296
Dennis G. Kafura, K. H. Lee:
Inheritance in Actor Based Concurrent Object-Oriented Languages. 297-304
W. R. Cook:
A Proposal for Making Eiffel Type-Safe. 305-311
Rajendra K. Raj, Henry M. Levy:
A Compositional Model for Software Reuse. 312-322
Graeme N. Dixon, Graham D. Parrington, Santosh K. Shrivastava, Stuart M. Wheater:
The Treatment of Persistent Objects in Arjuna. 323-332
Els Laenens, François Staes, Dirk Vermeir:
Browsing à la Carte in Object-Oriented Databases. 333-340
T. P. Hopkins, Mario Wolczko:
Writing Concurrent Object-Oriented Programs Using Smalltalk-80. 341-350
Martin C. Cooper:
Formal Hierarchical Object Models for Fast Template Matching. 351-361
Rami G. Melhem, Donald M. Chiarulli, Steven P. Levitan:
Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems. 362-369
J. P. Bennett, G. C. Smith:
The Need for Reduced Byte Stream Instruction Sets. 370-373
Chris J. Mitchell:
Another Postage Stamp Problem. 374-376

Short Note

A. Oxley:
Calculating Earthworks Volumes - An Exercise in Geometric Algorithms. 377-379

Ian Sommerville, Ronny Thomson:
An Approach to the Support of Software Evolution. 386-398
M. W. Shields:
Implicit System Specification and the Interface Equation. 399-412
Robin M. Gallimore, Derek Coleman, Victoria Stavridou:
UMIST OBJ: A Language for Executable Program Specifications. 413-421
C. McDonald, Lloyd Allison:
Denotational Semantics of a Command Interpreter and Their Implementation in Standard ML. 422-431
Brian A. Wichmann:
Towards a Formal Specification of Floating Point. 432-436
Luigi V. Mancini, Giuseppe Pappalardo:
Proving Correctness Properties of a Replicated Synchronous Program. 437-444
Vincent P. Heuring, Uwe Kastens, R. G. Plummer, William M. Waite:
COMAR: A Data Format for Integration of CFG Tools. 445-452
Panayotis Tsanakas, Nikitas A. Alexandridis, George K. Papakonstantinou:
An FP-Based Design Methodology for Problem-Oriented Architectures. 453-460
D. I. Bevan, Geoffrey L. Burn, R. J. Karia, J. D. Robson:
Principles For the Design of a Distributed Memory Architecture for Parallel Graph Reduction. 461-469
M. C. Er:
A New Algorithm for Generating Binary Trees Using Rotations. 470-473

Short Note

J. A. Ellis, P. M. Lepolesa: A Las Vegas Graph Colouring Algorithm. 474-476

David F. Brailsford, Richard J. Beach:
Electronic Publishing - A Journal and its Production. 482-493
Richard Furuta:
An Object-Based Taxonomy for Abstract Structure in Document Models. 494-504
Heather Brown:
Standards for Structured Documents. 505-514
Ian Ritchie:
HYPERTEXT - Moving Towards Large Volumes. 516-523
Robert A. Morris:
Rendering Digital Type: A Historical and Economic View of Technology. 524-532
Paul S. Licker:
Human Resource Management and Business Success in Small, Hi-Tech Firms: Some Lessons for Data Processing. 533-540
David A. Umphress, Udo W. Pooch, Murat Tanik:
Fast Prototyping of a Goal-Oriented Simulation Environment System. 541-548
J. R. Parker:
On the Conversion of Filled Polygonal Regions from Raster to Vector Representation. 549-553
G. H. Kirby, M. Visvaligam, P. Wade:
Recognition and Representation of Hierarchy of Polygons with Holes. 554-562
A. Quin, Y. Yanagisawa:
On Data Compaction of Scanning Curves. 563-566
Arch D. Robison, Brian J. Hafner, Steven Skiena:
Eight Pieces Cannot Cover a Chess Board. 567-570

Short Note

Michel Cosnard, Afonso Ferreira:
Generating Permutations on a VLSI Suitable Linear Network. 571-573

Last update Mon May 20 00:00:01 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page