default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Programming Languages and Systems (TOPLAS), Volume 4
Volume 4, Number 1, January 1982
- Martin S. Feather:
A System for Assisting Program Transformation. 1-20 - Andrew S. Tanenbaum
, Hans van Staveren, Johan W. Stevenson:
Using Peephole Optimization on Intermediate Code. 21-36 - Jayadev Misra, K. Mani Chandy:
Termination Detection of Diffusing Computations in Communicating Sequential Processes. 37-43 - James R. McGraw:
The VAL Language: Description and Analysis. 44-82 - Christoph M. Hoffmann, Michael J. O'Donnell:
Programming with Equations. 83-112 - M. Howard Williams:
A Flexible Notation for Syntactic Definitions. 113-119
Volume 4, Number 2, April 1982
- Fred B. Schneider:
Synchronization in Distributed Programs. 125-148 - Richard C. Holt, James R. Cordy, David B. Wortman:
An Introduction to S/SL: Syntax/Semantic Language. 149-178 - Eljas Soisalon-Soininen:
Inessential Error Entries and Their Use in LR Parser Optimization. 179-195 - Micha Sharir:
Some Observations Concerning Formal Differentiation of Set Theoretic Expressions. 196-225 - Charles S. Wetherell:
Error Data Values in the Data-Flow Language VAL. 226-238 - Richard J. Fateman:
High-Level Language Implications of the Proposed IEEE Floating-Point Standard. 239-257 - Alberto Martelli, Ugo Montanari:
An Efficient Unification Algorithm. 258-282 - Edward A. Ashcroft, William W. Wadge:
R/ for Semantics. 283-294 - Jacques J. Arsac, Yves Kodratoff:
Some Techniques for Recursion Removal from Recursive Programs. 295-322
Volume 4, Number 3, July 1982
- John L. Hennessy:
Symbolic Debugging of Optimized Code. 323-344 - Paolo Sipala:
Compact Storage of Binary Trees. 345-361 - Manfred Broy, Peter Pepper:
Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm. 362-381 - Leslie Lamport, Robert E. Shostak, Marshall C. Pease:
The Byzantine Generals Problem. 382-401 - Robert Paige, Shaye Koenig:
Finite Differencing of Computable Expressions. 402-454 - Susan S. Owicki, Leslie Lamport:
Proving Liveness Properties of Concurrent Programs. 455-495 - Mitchell Wand:
Deriving Target Code as a Representation of Continuation Semantics. 496-517
Volume 4, Number 4, October 1982
- Maurice Herlihy, Barbara Liskov:
A Value Transmission Method for Abstract Data Types. 527-551 - Richard C. Holt, David B. Wortman:
A Model for Implementing Euclid Modules and Prototypes. 552-562 - Ralph E. Griswold:
The Evaluation of Expressions in Icon. 563-584 - J. Bergeron, A. Dubuque:
A Structured APL System. 585-600 - Theodore P. Baker:
A One-Pass Algorithm for Overload Resolution in Ada. 601-614 - Frank DeRemer, Thomas J. Pennello:
Efficient Computation of LALR(1) Look-Ahead Sets. 615-649 - Robert B. K. Dewar, Micha Sharir, Elia Weixelbaum:
Transformational Derivation of a Garbage Collection Algorithm. 650-667 - H. J. Boom:
A Weaker Precondition for Loops. 668-677 - Jayadev Misra, K. Mani Chandy:
A Distributed Graph Algorithm: Knot Detection. 678-686 - William R. Mallgren:
Formal Specification of Graphic Data Types. 687-710 - James W. Thatcher, Eric G. Wagner, Jesse B. Wright:
Data Type Specification: Parameterization and the Power of Specification Techniques. 711-732 - John H. Williams:
On the Development of the Algebra of Functional Programs. 733-757 - Gary L. Peterson:
An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. ACM Trans. Program. Lang. Syst. 4(4): 758-762 (1982)
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-11-07 20:36 CET 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:
