Peter Lee, Fritz Henglein, Neil D. Jones
Conference Record of the 24th Symposium on Principles of Programming Languages
POPL, 1997.
@proceedings{POPL-1997, acmid = "263699", address = "Paris, France", editor = "Peter Lee and Fritz Henglein and Neil D. Jones", isbn = "0-89791-853-3", publisher = "{ACM Press}", title = "{Conference Record of the 24th Symposium on Principles of Programming Languages}", year = 1997, }
Contents (37 items)
- POPL-1997-ShapiroH #analysis #performance #points-to
- Fast and Accurate Flow-Insensitive Points-To Analysis (MS, SH), pp. 1–14.
- POPL-1997-Ruf #analysis #clustering #data flow #using
- Partitioning Dataflow Analyses Using Types (ER), pp. 15–26.
- POPL-1997-FradetM
- Shape Types (PF, DLM), pp. 27–39.
- POPL-1997-RemyV #ml #object-oriented
- Objective ML: A Simple Object-Oriented Extension of ML (DR, JV), pp. 40–53.
- POPL-1997-ChenH #linear #monad
- Rolling Your Own MADT — A Connection Between Linear Types and Monads (CPC, PH), pp. 54–66.
- POPL-1997-AptS #imperative #programming
- Search and Imperative Programming (KRA, AS), pp. 67–79.
- POPL-1997-Hanus #functional #logic programming
- A Unified Computation Model for Functional and Logic Programming (MH), pp. 80–93.
- POPL-1997-Middeldorp #call-by
- Call by Need Computations to Root-Stable Form (AM), pp. 94–105.
- POPL-1997-Necula
- Proof-Carrying Code (GCN), pp. 106–119.
- POPL-1997-PlezbertC #question
- Is “Just in Time” = “Better Late than Never”? (MPP, RC), pp. 120–131.
- POPL-1997-BankLM #java
- Parameterized Types for Java (ACM, JAB, BL), pp. 132–145.
- POPL-1997-OderskyW #java
- Pizza into Java: Translating Theory into Practice (MO, PW), pp. 146–159.
- POPL-1997-CarterFH
- Determining the Idle Time of a Tiling (KH, LC, JF), pp. 160–173.
- POPL-1997-Godefroid #model checking #programming language #using
- Model Checking for Programming Languages using Verisoft (PG), pp. 174–186.
- POPL-1997-RinardD #parallel
- Synchronization Transformations for Parallel Computing (PCD, MCR), pp. 187–200.
- POPL-1997-LimL #parallel
- Maximizing Parallelism and Minimizing Synchronization with Affine Transforms (AWL, MSL), pp. 201–214.
- POPL-1997-OngS #functional
- A Curry-Howard Foundation for Functional Computation with Control (CHLO, CAS), pp. 215–227.
- POPL-1997-Boudol #π-calculus
- The π-calculus in Direct Style (GB), pp. 228–241.
- POPL-1997-PierceS #behaviour #equivalence #polymorphism #π-calculus
- Behavioral Equivalence in the Polymorphic π-calculus (BCP, DS), pp. 242–255.
- POPL-1997-Palamidessi #power of #π-calculus
- Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus (CP), pp. 256–265.
- POPL-1997-Cardelli #composition
- Program Fragments, Linking, and Modularization (LC), pp. 266–277.
- POPL-1997-Rehof #type system
- Minimal Typings in Atomic Subtyping (JR), pp. 278–291.
- POPL-1997-Saibi #algorithm #inheritance #type system
- Typing Algorithm in Type Theory with Inheritance (AS), pp. 292–301.
- POPL-1997-BourdoncleM #higher-order #multi #polymorphism
- Type-Checking Higher-Order Polymorphic Multi-Methods (FB, SM), pp. 302–315.
- POPL-1997-Cousot #abstract interpretation
- Types as Abstract Interpretations (PC), pp. 316–331.
- POPL-1997-NielsonN #analysis #control flow #semantics
- Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis (HRN, FN), pp. 332–345.
- POPL-1997-Halbwachs #automation #linear #network #process #verification
- Automatic Verification of Parameterized Linear Networks of Processes (DL, NH, PR), pp. 346–357.
- POPL-1997-Deutsch #analysis #complexity #on the
- On the Complexity of Escape Analysis (AD), pp. 358–371.
- POPL-1997-Biswas #analysis
- A Demand-Driven Set-Based Analysis (SKB), pp. 372–385.
- POPL-1997-WandS #semantics #using
- Denotational Semantics Using an Operationally-Based Term Model (MW, GTS), pp. 386–399.
- POPL-1997-SeidlS #constraints #deforestation #higher-order
- Constraints to Stop Higher-Order Deforestation (HS, MHS), pp. 400–413.
- POPL-1997-PettorossiPR #logic programming #nondeterminism #source code
- Reducing Nondeterminism while Specializing Logic Programs (AP, MP, SR), pp. 414–427.
- POPL-1997-Sands #functional #proving
- From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages (DS), pp. 428–441.
- POPL-1997-Kennedy #parametricity #relational
- Relational Parametricity and Units of Measure (AK), pp. 442–455.
- POPL-1997-PaigeY #compilation #data type
- High Level Reading and Data Structure Compilation (RP, ZY), pp. 456–469.
- POPL-1997-JanssonJ #named #programming language
- Polyp — A Polytypic Programming Language (PJ, JJ), pp. 470–482.
- POPL-1997-Jones #morphism #polymorphism #type inference
- First-class Polymorphism with Type Inference (MPJ), pp. 483–496.
5 ×#analysis
3 ×#functional
3 ×#polymorphism
3 ×#using
3 ×#π-calculus
2 ×#higher-order
2 ×#java
2 ×#linear
2 ×#logic programming
2 ×#parallel
3 ×#functional
3 ×#polymorphism
3 ×#using
3 ×#π-calculus
2 ×#higher-order
2 ×#java
2 ×#linear
2 ×#logic programming
2 ×#parallel