Conference Record of the 21st Symposium on Principles of Programming Languages
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Hans-Juergen Boehm, Bernard Lang, Daniel M. Yellin
Conference Record of the 21st Symposium on Principles of Programming Languages
POPL, 1994.

PLT
DBLP
Scholar
Full names Links ISxN
@proceedings{POPL-1994,
	acmid         = "174675",
	address       = "Portland, Oregon, USA",
	editor        = "Hans-Juergen Boehm and Bernard Lang and Daniel M. Yellin",
	isbn          = "0-89791-636-0",
	publisher     = "{ACM Press}",
	title         = "{Conference Record of the 21st Symposium on Principles of Programming Languages}",
	year          = 1994,
}

Contents (39 items)

POPL-1994-DiwanTM #garbage collection #memory management #performance #source code #using
Memory Subsystem Performance of Programs Using Copying Garbage Collection (AD, DT, JEBM), pp. 1–14.
POPL-1994-Ramsey #correctness #implementation
Correctness of Trap-Based Breakpoint Implementations (NR), pp. 15–24.
POPL-1994-Agrawal
Dominators, Super Blocks, and Program Coverage (HA), pp. 25–34.
POPL-1994-GarrigueA #polymorphism #λ-calculus
The Typed Polymorphic Label-Selective λ-Calculus (JG, HAK), pp. 35–47.
POPL-1994-Odersky #functional
A Functional Theory of Local Names (MO), pp. 48–59.
POPL-1994-Lescanne #calculus
From λσ to λν: a Journey Through Calculi of Explicit Substitutions (PL), pp. 60–69.
POPL-1994-DoligezG #garbage collection #multi
Portable, Unobtrusive Garbage Collection for Multiprocessor Systems (DD, GG), pp. 70–83.
POPL-1994-NielsonN #communication #concurrent #finite #higher-order #source code
Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
POPL-1994-BoerGMP #concurrent #constraints #proving #source code
Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
POPL-1994-Leroy #compilation
Manifest Types, Modules, and Separate Compilation (XL), pp. 109–122.
POPL-1994-HarperL #approach #higher-order
A Type-Theoretic Approach to Higher-Order Modules with Sharing (RH, ML), pp. 123–137.
POPL-1994-KatiyarLM #prototype #type system
A Type System for Prototyping Languages (DK, DCL, JCM), pp. 138–150.
POPL-1994-CastagnaP #bound #decidability #quantifier
Decidable Bounded Quantification (GC, BCP), pp. 151–162.
POPL-1994-AikenWL #type system
Soft Typing with Conditional Types (AA, ELW, TKL), pp. 163–173.
POPL-1994-Thatte #adaptation #automation #interface #reuse #synthesis
Automated Synthesis of Interface Adapters for Reusable Classes (ST), pp. 174–187.
POPL-1994-TofteT #call-by #implementation #stack #using #λ-calculus
Implementation of the Typed Call-by-Value λ-Calculus using a Stack of Regions (MT, JPT), pp. 188–201.
POPL-1994-HankinM #algorithm #analysis #strict #type inference
Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis (CH, DLM), pp. 202–212.
POPL-1994-HengleinJ
Formally Optimal Boxing (FH, JJ), pp. 213–226.
POPL-1994-CortesiCH #abstract domain #logic programming
Combinations of Abstract Domains for Logic Programming (AC, BLC, PVH), pp. 227–239.
POPL-1994-MarriottBH #logic programming #scheduling #source code
Analyzing Logic Programs with Dynamic Scheduling (KM, MJGdlB, MVH), pp. 240–253.
POPL-1994-Qian #equation #higher-order #logic programming
Higher-Order Equational Logic Programming (ZQ), pp. 254–267.
POPL-1994-AntoyEH
A Needed Narrowing Strategy (SA, RE, MH), pp. 268–279.
POPL-1994-ProebstingF #detection #pipes and filters
Detecting Pipeline Structural Hazards Quickly (TAP, CWF), pp. 280–286.
POPL-1994-RamalingamR #algorithm #incremental #maintenance
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph (GR, TWR), pp. 287–296.
POPL-1994-WeiseCES #dependence #graph #representation
Value Dependence Graphs: Representation without Taxation (DW, RFC, MDE, BS), pp. 297–310.
POPL-1994-Maslov #analysis #array #data flow #dependence #lazy evaluation
Lazy Array Data-Flow Dependence Analysis (VM), pp. 311–325.
POPL-1994-CleavelandY #framework #process
An Operational Framework for Value-Passing Processes (RC, DY), pp. 326–338.
POPL-1994-Bloom #communication #higher-order #named #λ-calculus
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (BB), pp. 339–347.
POPL-1994-HondaY #combinator #mobile #process #representation
Combinatory Representation of Mobile Processes (KH, NY), pp. 348–360.
POPL-1994-Paakki #execution #functional #logic programming #multi #source code
Multi-Pass Execution of Functional Logic Programs (JP), pp. 361–374.
POPL-1994-BoylandG
Composing Tree Attributions (JB, SLG), pp. 375–388.
POPL-1994-Muller #calculus #staging #verification
A Staging Calculus and its Application to the Verification of Translators (RM), pp. 389–396.
POPL-1994-CalderG #c++ #source code
Reducing Indirect Function call Overhead in C++ Programs (BC, DG), pp. 397–408.
POPL-1994-BosschereDGK #interprocedural #optimisation
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages (KDB, SKD, DG, SK), pp. 409–420.
POPL-1994-FeigenKCX
The Revival Transformation (LF, DK, RC, XX), pp. 421–434.
POPL-1994-WandS #lightweight
Selective and Lightweight Closure Conversion (MW, PS), pp. 435–445.
POPL-1994-Filinski #monad #representation
Representing Monads (AF), pp. 446–457.
POPL-1994-HatcliffD #continuation
A Generic Account of Continuation-Passing Styles (JH, OD), pp. 458–471.
POPL-1994-Steele #monad
Building Interpreters by Composing Monads (GLSJ), pp. 472–492.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.