default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th POPL 1983: Austin, Texas, USA
- John R. Wright, Larry Landweber, Alan J. Demers, Tim Teitelbaum:
Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 1983. ACM Press 1983, ISBN 0-89791-090-7 - Vaughan R. Pratt:
Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment. 1-9 - Jeffrey Bonar, Elliot Soloway:
Uncovering Principles of Novice Programming. 10-13 - Stephen C. Johnson:
Code Generation for Silicon. 14-19 - Ralph-Johan Back, Heikki Mannila, Kari-Jouko Räihä:
Derivation of Efficient DAG Marking Algorithms. 20-27 - Leslie Lamport:
Reasoning About Nonatomic Operations. 28-37 - Greg Nelson:
Verifying Reachability Invariants of Linked Structures. 38-47 - John Nagle, Scott Johnson:
Practical Program Verification: Automatic Program Proving for Real-Time Embedded Software. 48-58 - Alan J. Demers, James E. Donahue:
Making Variables Abstract: An Equational Theory for Russell. 59-72 - Robert Paige:
Transformational Programming - Applications to Algorithms and Systems. 73-87 - Daniel Leivant:
Polymorphic Type Inference. 88-98 - Pierre Lescanne:
Computer Experiments with the Reve Term Rewriting System Generator. 99-108 - Richard B. Kieburtz:
Precise Typing of Abstract Data Type Specifications. 109-116 - Edmund M. Clarke, E. Allen Emerson, A. Prasad Sistla:
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach. 117-126 - E. Allen Emerson, Joseph Y. Halpern:
"Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time. 127-140 - Zohar Manna, Amir Pnueli:
How to Cook a Temporal Proof System for Your Pet Language. 141-154 - Daniel Leivant:
Structural Semantics for Polymorphic Data Types. 155-166 - Barbara G. Ryder:
Incremental Data Flow Analysis. 167-176 - John R. Allen, Ken Kennedy, Carrie Porterfield, Joe D. Warren:
Conversion of Control Dependence to Data Dependence. 177-189 - Mitchell Wand:
Loops in Combinator-Based Compilers. 190-196 - Janice E. Cuny, Lawrence Snyder:
Compilation of Data-Driven Programs for Synchronous Execution. 197-202 - Mark N. Wegman:
Summarizing Graphs by Regular Expressions. 203-216 - Jeanne Ferrante, Karl J. Ottenstein:
A Program Form Based on Data Dependency in Predicate Regions. 217-236 - Butler W. Lampson, Eric E. Schmidt:
Practical Use of a Polymorphic Applicative Language. 237-255 - Peter Wegner:
On the Unification of Data and Program Abstraction in Ada. 256-264 - Lambert G. L. T. Meertens:
Incremental Polymorphic Type Checking in B. 265-275 - Robert E. Strom:
Mechanisms for Compile-Time Enforcement of Security. 276-284 - Bent Bruun Kristensen, Ole Lehrmann Madsen
, Birger Møller-Pedersen, Kristen Nygaard:
Abstraction Mechanisms in the Beta Programming Language. 285-298 - Naftaly H. Minsky:
Locality in Software Systems. 299-312
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.
last updated on 2024-09-19 23:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
