Conference Record of the 13th Annual Symposium on Principles of Programming Languages
POPL, 1986.
@proceedings{POPL-1986, acmid = "512644", address = "St. Petersburg Beach, Florida, USA", publisher = "{ACM Press}", title = "{Conference Record of the 13th Annual Symposium on Principles of Programming Languages}", year = 1986, }
Contents (30 items)
- POPL-1986-RepsMT #editing
- Remote Attribute Updating for Language-Based Editors (TWR, CM, TT), pp. 1–13.
- POPL-1986-Hoover #attribute grammar
- Dynamically Bypassing Copy Rule Chains in Attribute Grammars (RH), pp. 14–25.
- POPL-1986-KatayamaS #attribute grammar
- Global Storage Allocation in Attribute Evaluation (TK, HS), pp. 26–37.
- POPL-1986-Wand #fault
- Finding the Source of Type Errors (MW), pp. 38–43.
- POPL-1986-JohnsonW #approach #incremental #type inference
- A Maximum-Flow Approach to Anomaly Isolation in Unification-Based Incremental Type Inference (GFJ, JAW), pp. 44–57.
- POPL-1986-JonesS #attribute grammar #design
- Hierarchical VLSI Design Systems Based on Attribute Grammars (LGJ, JS), pp. 58–69.
- POPL-1986-CytronLZ
- Code Motion of Control Structures in High-Level Languages (RC, AL, FKZ), pp. 70–85.
- POPL-1986-JorringS #compilation #staging
- Compilers and Staging Transformations (UJ, WLS), pp. 86–96.
- POPL-1986-HudakY #analysis #higher-order #strict #λ-calculus
- Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
- POPL-1986-Coutant #alias #analysis
- Retargetable High-Level Alias Analysis (DSC), pp. 110–118.
- POPL-1986-HatcherC #bottom-up #code generation #pattern matching
- High-Quality Code Generation Via Bottom-Up Tree Pattern Matching (PJH, TWC), pp. 119–130.
- POPL-1986-Chen #compilation #parallel
- A Parallel Language and its Compilation to Multiprocessor Machines or VLSI (MCC), pp. 131–139.
- POPL-1986-Kurki-Suonio #programming #towards
- Towards Programming with Knowledge Expressions (RKS), pp. 140–149.
- POPL-1986-LiskovHG #communication #distributed #process
- Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing (BL, MH, LG), pp. 150–159.
- POPL-1986-GreifSW #abstraction #collaboration #distributed #editing
- Atomic Data Abstractions in a Distributed Collaborative Editing System (IG, RS, WEW), pp. 160–172.
- POPL-1986-BarringerKP #concurrent #logic
- A Really Abstract Concurrent Model and its Temporal Logic (HB, RK, AP), pp. 173–183.
- POPL-1986-Wolper #logic #source code
- Expressing Interesting Properties of Programs in Propositional Temporal Logic (PW), pp. 184–193.
- POPL-1986-AmericaBKR #object-oriented #parallel #semantics
- Operational Semantics of a Parallel Object-Oriented Language (PA, JdB, JNK, JJMMR), pp. 194–208.
- POPL-1986-YouS #equation #logic programming
- Equational Logic Programming: An Extension to Equational Programming (JHY, PAS), pp. 209–218.
- POPL-1986-Ait-KaciN #inheritance #logic
- Logic and Inheritance (HAK, RN), pp. 219–228.
- POPL-1986-SneltingH #algebra #analysis #incremental #semantics #unification
- Unification in Many-Sorted Algebras as a Device for Incremental Semantic Analysis (GS, WH), pp. 229–235.
- POPL-1986-CarrieroGL #data type #distributed
- Distributed Data Structures in Linda (NC, DG, JL), pp. 236–242.
- POPL-1986-HudakS #multi #paradigm #programming
- Para-Functional Programming: A Paradigm for Programming Multiprocessor Systems (PH, LS), pp. 243–254.
- POPL-1986-RamakrishnanS #distributed #logic #programming
- Annotations for Distributed Programming in Logic (RR, AS), pp. 255–262.
- POPL-1986-Mitchell #abstraction #independence #representation
- Representation Independence and Data Abstraction (JCM), pp. 263–276.
- POPL-1986-MacQueen #composition #dependent type #using
- Using Dependent Types to Express Modular Structure (DBM), pp. 277–286.
- POPL-1986-MeyerR
- “Type” Is Not A Type (ARM, MBR), pp. 287–295.
- POPL-1986-JonesM #analysis #data flow #graph #source code #using
- Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
- POPL-1986-LengauerH #concurrent #network #sorting #theorem
- A Mechanically Certified Theorem about Optimal Concurrency of Sorting Networks (CL, CHH), pp. 307–317.
- POPL-1986-JeffersonK #execution #quantifier #specification
- Executable Specifications with Quantifiers in the FASE System (SJ, SNK), pp. 318–326.
4 ×#analysis
4 ×#distributed
4 ×#logic
3 ×#programming
2 ×#abstraction
2 ×#attribute grammar
2 ×#compilation
2 ×#concurrent
2 ×#editing
2 ×#incremental
4 ×#distributed
4 ×#logic
3 ×#programming
2 ×#abstraction
2 ×#attribute grammar
2 ×#compilation
2 ×#concurrent
2 ×#editing
2 ×#incremental