default search action
9th POPL 1982: Albuquerque, New Mexico, USA
- Richard A. DeMillo:
Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 1982. ACM Press 1982, ISBN 0-89791-065-6 - Sergiu Hart, Micha Sharir, Amir Pnueli:
Termination of Probabilistic Concurrent Programs. 1-6 - Barbara Liskov, Robert Scheifler:
Guardians and Actions: Linguistic Support for Robust, Distributed Programs. 7-19 - Pierre Wolper:
Specification and Synthesis of Communicating Processes using an Extended Temporal Logic. 20-33 - David W. Wall:
Messages as Active Agents. 34-39 - Nissim Francez:
Extended Naming Conventions for Communicating Processes. 40-45 - John H. Reif, Paul G. Spirakis:
Unbounded Speed Variability in Distributed Communication Systems. 46-56 - Richard J. Lipton, Robert Sedgewick, Jacobo Valdes:
Programming Aspects of VLSI. 57-65 - Neil D. Jones, Steven S. Muchnick:
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. 66-74 - Robert Giegerich:
Automatic Generation of Machine Specific Code Optimizers. 75-81 - M. V. S. Ramanath, Marvin H. Solomon:
Optimal Code for Control Structures. 82-94 - Rodney Farrow:
Experience with an Attribute Grammar-Based Compiler. 95-107 - Mahadevan Ganapathi, Charles N. Fischer:
Description-Driven Code Generation using Attribute Grammars. 108-119 - John L. Hennessy, Thomas R. Gross:
Code Generation and Reorganization in the Presence of Pipeline Constraints. 120-127 - Jack W. Davidson, Christopher W. Fraser:
Eliminating Redundant Object Code. 128-132 - Alan Borning, Daniel H. H. Ingalls:
A Type Declaration and Inference System for Smalltalk. 133-141 - David W. Sandberg:
Lithe: A Language Combining a Flexible Syntax, Classes. 142-145 - Erik Sandewall:
Unified Dialogue Management in the Carousel System. 146-156 - Paul J. Voda:
Maple: a Programming Language, Operating System. 157-168 - Thomas W. Reps:
Optimal-Time Incremental Semantic Analysis for Syntax-Directed Editors. 169-176 - Seppo Sippu, Eljas Soisalon-Soininen:
Practical Error Recovery in LR Parsing. 177-184 - Gregory F. Johnson, Charles N. Fischer:
Non-Syntactic Attribute Flow in Language Based Editors. 185-195 - Fahimeh Jalili, Jean H. Gallier:
Building Friendly Parsers. 196-206 - Luís Damas, Robin Milner:
Principal Type-Schemes for Functional Programs. 207-212 - Vaughan R. Pratt:
On the Composition of Processes. 213-223 - Lawrence C. Paulson:
A Semantics-Directed Compiler Generator. 224-233 - Mitchell Wand:
Semantics-Directed Machine Architecture. 234-241 - Martin C. Henson, Raymond Turner:
Completion Semantics, Interpreter Generation. 242-254 - Henryk Jan Komorowski:
Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog. 255-267 - Hans-Juergen Boehm:
A Logic for Expressions with Side-Effects. 268-280 - Shaula Yemini:
An Axiomatic Treatment of Exception Handling. 281-288 - E. Gansner, Joseph R. Horgan, Chandra M. R. Kintala, D. J. Moore, Pamela Surko:
Semantics and Correctness of a Query Language Translation. 289-298 - Ehud Y. Shapiro:
Algorithmic Program Diagnosis. 299-308 - Edmund M. Clarke, Steven M. German, Joseph Y. Halpern:
On Effective Axiomatizations of Hoare Logics. 309-321 - Brent Hailpern, Susan S. Owicki:
Modular Verification of Concurrent Programs. 322-336 - Albert R. Meyer, John C. Mitchell:
Axiomatic Definability and Completeness for Recursive Programs. 337-346 - Rivi Sherman, Amir Pnueli, David Harel:
Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDL. 347-360 - Eric C. Cooper:
On the Expressive Power of Query Languages for Relational Databases. 361-365 - Adrienne Critcher:
On the Ability of Structures to Store and Access Information. 366-378
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.