Conference Record of POPL '94, 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: Papers Presented at the Symposium : Portland, Oregon, January 17-21, 1994

Front Cover
Association for Computing Machinery
Pearson Education, Jan 1, 1994 - Computer science - 492 pages
0 Reviews
Proceedings -- Parallel Computing.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

9001030 a m Chaired by Vivek Sarkar IBM Santa Teresa Lab
1
Correctness of TrapBased Breakpoint Implementations
15
Dominators Super Blocks and Program Coverage
25
1100 a m 1230 p m Chaired by Peter Lee Carnegie Mellon University
35
A Functional Theory of Local Names
48
From cr to v a Journey Through Calculi of Explicit Substitutions
60
200330 p m Chaired by William Pugh University of Maryland
70
HigherOrder Concurrent Programs with Finite Communication Topology
84
HigherOrder Equational Logic Programming
254
A Needed Narrowing Strategy
268
200400 p m Chaired by Kenny Zadeck IBM T J Watson Research
280
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
287
Representation without Taxation
297
Lazy Array DataFlow Dependence Analysis
311
430600 p m Chaired by Gerard Berry Ecole des Mines SophiaAntipolis
326
Calculi of Higher Order Communication and LAmbda TErms
339

Proving Concurrent Constraint Programs Correct
98
400530 p m Chaired by JOHN LAUNCHBURY Glasgow University
109
A Type Theoretic Approach to HigherOrder Modules with Sharing
123
A Type System for Prototyping Languages
138
9001030 a m Chaired by Luca Cardelli DEC Systems Research Center
151
Soft Typing with Conditional Types
163
Automated Synthesis of Interface Adapters for Reusable Classes
174
11001230 a m Chaired by HansJ Boehm Xerox PARC
188
Application to Strictness Analysis
202
Formally Optimal Boxing
213
200400 p m Chaired by Dale Miller University of Pennsylvania
227
Analyzing Logic Programs with Dynamic Scheduling
240
Combinatory Representation of Mobile Processes
348
430600 p m Chaired by RODNEY Farrow Declarative Systems
361
Composing Tree Attributions
375
A Staging Calculus and its Application to the Verification of Translators
389
Wednesday January 13
397
A Simple Interprocedural Optimization Technique for Dynamically
409
The Revival Transformation
421
1030 a m 1230 p m Chaired by Carolyn Talcott Stanford University
435
Representing Monads
446
A Generic Account of ContinuationPas sing Styles
458
Building Interpreters by Composing Monads
472
Copyright

Common terms and phrases

Bibliographic information