Abstract is missing.
- Using formal methods to enable more secure vehicles: DARPA's HACMS programKathleen Fisher. 1 [doi]
- Building embedded systems with embedded DSLsPatrick C. Hickey, Lee Pike, Trevor Elliott, James Bielman, John Launchbury. 3-9 [doi]
- Concurrent NetCore: from policies to pipelinesCole Schlesinger, Michael Greenberg, David Walker. 11-24 [doi]
- SeLINQ: tracking information across application-database boundariesDaniel Schoepe, Daniel Hedin, Andrei Sabelfeld. 25-38 [doi]
- Type-based parametric analysis of program familiesSheng Chen 0008, Martin Erwig. 39-51 [doi]
- Romeo: a system for more flexible binding-safe programmingPaul Stansifer, Mitchell Wand. 53-65 [doi]
- Maximal sharing in the Lambda calculus with letrecClemens Grabmayer, Jan Rochel. 67-80 [doi]
- Practical and effective higher-order optimizationsLars Bergstrom, Matthew Fluet, Matthew Le, John H. Reppy, Nora Sandler. 81-93 [doi]
- Worker/wrapper/makes it/fasterJennifer Hackett, Graham Hutton. 95-107 [doi]
- Compositional semantics for composable continuations: from abortive to delimited controlPaul Downen, Zena M. Ariola. 109-122 [doi]
- Coeffects: a calculus of context-dependent computationTomas Petricek, Dominic A. Orchard, Alan Mycroft. 123-135 [doi]
- Behavioral software contractsRobby Findler. 137-138 [doi]
- Soft contract verificationPhuc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn. 139-152 [doi]
- On teaching *how to design programs*: observations from a newcomerNorman Ramsey. 153-166 [doi]
- SML# in industry: a practical ERP system developmentAtsushi Ohori, Katsuhiro Ueno, Kazunori Hoshi, Shinji Nozaki, Takashi Sato, Tasuku Makabe, Yuki Ito. 167-173 [doi]
- Lem: reusable engineering of real-world semanticsDominic P. Mulligan, Scott Owens, Kathryn E. Gray, Tom Ridge, Peter Sewell. 175-188 [doi]
- Safe zero-cost coercions for HaskellJoachim Breitner, Richard A. Eisenberg, Simon L. Peyton Jones, Stephanie Weirich. 189-202 [doi]
- Hindley-milner elaboration in applicative style: functional pearlFrançois Pottier. 203-212 [doi]
- Settable and non-interfering signal functions for FRP: how a first-order switch is more than enoughDaniel Winograd-Cort, Paul Hudak. 213-225 [doi]
- Functional programming for dynamic and large data with self-adjusting computationYan Chen 0001, Umut A. Acar, Kanat Tangwongsan. 227-240 [doi]
- Depending on typesStephanie Weirich. 241 [doi]
- Homotopical patch theoryCarlo Angiuli, Edward Morehouse, Daniel R. Licata, Robert Harper. 243-256 [doi]
- Pattern matching without KJesper Cockx, Dominique Devriese, Frank Piessens. 257-268 [doi]
- Refinement types for HaskellNiki Vazou, Eric L. Seidel, Ranjit Jhala, Dimitrios Vytiniotis, Simon L. Peyton Jones. 269-282 [doi]
- A theory of gradual effect systemsFelipe Bañados Schwerter, Ronald Garcia, Éric Tanter. 283-295 [doi]
- How to keep your neighbours in orderConor Thomas McBride. 297-309 [doi]
- A relational framework for higher-order shape analysisGowtham Kaki, Suresh Jagannathan. 311-324 [doi]
- There is no fork: an abstraction for efficient, concurrent, and concise data accessSimon Marlow, Louis Brandy, Jonathan Coens, Jon Purdy. 325-337 [doi]
- Folding domain-specific languages: deep and shallow embeddings (functional Pearl)Jeremy Gibbons, Nicolas Wu. 339-347 [doi]
- Krivine nets: a semantic foundation for distributed executionOlle Fredriksson, Dan R. Ghica. 349-361 [doi]
- Distilling abstract machinesBeniamino Accattoli, Pablo Barenbaum, Damiano Mazza. 363-376 [doi]