Frances E. Allen
Conference Record of the 17th Annual Symposium on Principles of Programming Languages
POPL, 1990.
@proceedings{POPL-1990, acmid = "96709", address = "San Francisco, California, USA", editor = "Frances E. Allen", isbn = "0-89791-343-4", publisher = "{ACM Press}", title = "{Conference Record of the 17th Annual Symposium on Principles of Programming Languages}", year = 1990, }
Contents (31 items)
- POPL-1990-Field #analysis #lazy evaluation #on the #specification #tool support
- On Laziness and Optimality in λ Interpreters: Tools for Specification and Analysis (JF), pp. 1–15.
- POPL-1990-Lamping #algorithm #reduction #λ-calculus
- An Algorithm for Optimal λ Calculus Reduction (JL), pp. 16–30.
- POPL-1990-AbadiCCL
- Explicit Substitutions (MA, LC, PLC, JJL), pp. 31–46.
- POPL-1990-Griffin #type system
- A Formulae-as-Types Notion of Control (TG), pp. 47–58.
- POPL-1990-AspertiFG #proving
- Implicative Formulae in the “Proofs as Computations” Analogy (AA, GLF, RG), pp. 59–71.
- POPL-1990-Moschovakis #process
- Computable processes (YNM), pp. 72–80.
- POPL-1990-BerryB #automaton
- The Chemical Abstract Machine (GB, GB), pp. 81–94.
- POPL-1990-Lafont #interactive
- Interaction Nets (YL), pp. 95–108.
- POPL-1990-Mitchell #inheritance #towards
- Toward a Typed Foundation for Method Specialization and Inheritance (JCM), pp. 109–124.
- POPL-1990-CookHC #inheritance #type system
- Inheritance Is Not Subtyping (WRC, WLH, PSC), pp. 125–135.
- POPL-1990-GraverJ #smalltalk #type system
- A Type System for Smalltalk (JOG, REJ), pp. 136–150.
- POPL-1990-Burn #abstract interpretation #analysis
- A Relationship Between Abstract Interpretation and Projection Analysis (GLB), pp. 151–156.
- POPL-1990-Deutsch #alias #functional #higher-order #on the #specification
- On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications (AD), pp. 157–168.
- POPL-1990-SekarPR #analysis #performance #strict
- Small Domains Spell Fast Strictness Analysis (RCS, SP, IVR), pp. 169–183.
- POPL-1990-MarloweR #algorithm #analysis #data flow #hybrid #incremental #performance
- An Efficient Hybrid Algorithm for Incremental Data Flow Analysis (TJM, BGR), pp. 184–196.
- POPL-1990-HeintzeJ #approximate #finite #logic programming #source code #theorem
- A Finite Presentation Theorem for Approximating Logic Programs (NH, JJ), pp. 197–209.
- POPL-1990-AikenWW #fault #program transformation
- Program Transformation in the Presence of Errors (AA, JHW, ELW), pp. 210–217.
- POPL-1990-Steele #parallel
- Making Asynchronous Parallelism Safe for the World (GLSJ), pp. 218–231.
- POPL-1990-SaraswatR #concurrent #constraints #programming
- Concurrent Constraint Programming (VAS, MCR), pp. 232–245.
- POPL-1990-Ramakrishnan #logic programming #parallel #source code
- Parallelism in Logic Programs (RR), pp. 246–260.
- POPL-1990-DemersWHBBS #framework #garbage collection #implementation
- Combining Generational and Conservative Garbage Collection: Framework and Implementations (AJD, MW, BH, HJB, DGB, SS), pp. 261–269.
- POPL-1990-PalemS #scheduling
- Scheduling Time-Critical Instructions on RISC Machines (KVP, BBS), pp. 270–280.
- POPL-1990-RameshRW #prolog
- Automata-Driven Indexing of Prolog Clauses (RR, IVR, DSW), pp. 281–291.
- POPL-1990-AttieFG #interactive #multi
- Fairness and Hyperfairness in Multi-Party Interactions (PCA, NF, OG), pp. 292–305.
- POPL-1990-Gunter #correctness #nondeterminism #source code
- Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs (CAG), pp. 306–319.
- POPL-1990-Russell #network #on the #principle
- On Oraclizable Networks and Kahn’s Principle (JRR), pp. 320–328.
- POPL-1990-Stark #automaton #concurrent #on the
- On the Relations Computable by a Class of Concurrent Automata (EWS), pp. 329–340.
- POPL-1990-HarperMM #higher-order
- Higher-Order Modules and the Phase Distinction (RH, JCM, EM), pp. 341–354.
- POPL-1990-Rouaix #runtime
- Safe Run-time Overloading (FR), pp. 355–366.
- POPL-1990-Thatte #static typing #type system
- Quasi-Static Typing (SRT), pp. 367–381.
- POPL-1990-Mairson #exponential #ml
- Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.
4 ×#analysis
4 ×#on the
4 ×#type system
3 ×#source code
2 ×#algorithm
2 ×#automaton
2 ×#concurrent
2 ×#higher-order
2 ×#inheritance
2 ×#interactive
4 ×#on the
4 ×#type system
3 ×#source code
2 ×#algorithm
2 ×#automaton
2 ×#concurrent
2 ×#higher-order
2 ×#inheritance
2 ×#interactive