Abstract is missing.
- The development of Chez SchemeR. Kent Dybvig. 1-12 [doi]
- Improving flow analyses via GammaCFA: abstract garbage collection and countingMatthew Might, Olin Shivers. 13-25 [doi]
- Delimited dynamic bindingOleg Kiselyov, Chung-chieh Shan, Amr Sabry. 26-37 [doi]
- Static typing for a faulty lambda calculusDavid Walker, Lester W. Mackey, Jay Ligatti, George A. Reis, David I. August. 38-49 [doi]
- Simple unification-based type inference for GADTsSimon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Geoffrey Washburn. 50-61 [doi]
- Polymorphism and separation in hoare type theoryAleksandar Nanevski, Greg Morrisett, Lars Birkedal. 62-73 [doi]
- Recursive modules for programmingKeiko Nakata, Jacques Garrigue. 74-86 [doi]
- From structures and functors to modules and unitsScott Owens, Matthew Flatt. 87-98 [doi]
- The missing link: dynamic components for MLAndreas Rossberg. 99-110 [doi]
- Static analysis for syntax objectsDavid Fisher, Olin Shivers. 111-121 [doi]
- Practical proofs of concurrent programsMarc Shapiro. 123 [doi]
- Transactional eventsKevin Donnelly, Matthew Fluet. 124-135 [doi]
- Stabilizers: a modular checkpointing abstraction for concurrent functional programsLukasz Ziarek, Philip Schatz, Suresh Jagannathan. 136-147 [doi]
- Modelling deterministic concurrent I/OMalcolm Dowse, Andrew Butterfield. 148-159 [doi]
- Modular development of certified program verifiers with a proof assistantAdam J. Chlipala. 160-171 [doi]
- Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflectionJason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov. 172-183 [doi]
- Equality of streams is a Pi0 over 2-complete problemGrigore Rosu. 184-191 [doi]
- OCaml + XDuceAlain Frisch. 192-200 [doi]
- biXid: a bidirectional transformation language for XMLShinya Kawanaka, Haruo Hosoya. 201-214 [doi]
- Fifteen years of functional pearlsRichard S. Bird. 215 [doi]
- A pattern for almost compositional functionsBjörn Bringert, Aarne Ranta. 216-226 [doi]
- Algebraic fusion of functions with an accumulating parameter and its improvementShin-ya Katsumata, Susumu Nishimura. 227-238 [doi]
- Extensible programming with first-class casesMatthias Blume, Umut A. Acar, Wonseok Chae. 239-250 [doi]
- Boxy types: inference for higher-rank types and impredicativityDimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones. 251-262 [doi]
- Access control in a core calculus of dependencyMartín Abadi. 263-273 [doi]
- Programming monads operationally with UnimoChuan-Kai Lin. 274-285 [doi]
- Abstraction preservation and subtyping in distributed languagesPierre-Malo Deniélou, James J. Leifer. 286-297 [doi]