ICFP 2010

36 papers

1. A certified framework for compiling and executing garbage-collected languages · Andrew McCreight, Tim Chevalier, Andrew P. Tolmach
2. A fresh look at programming with names and binders · Nicolas Pouillard, François Pottier
3. A play on regular expressions: functional pearl · Sebastian Fischer, Frank Huch, Thomas Wilke
4. Abstracting abstract machines · David Van Horn, Matthew Might
5. Bidirectionalizing graph transformations · Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano
6. Combining syntactic and semantic bidirectionalization · Janis Voigtländer, Zhenjiang Hu, Kazutaka Matsuda, Meng Wang
7. Distance makes the types grow stronger: a calculus for differential privacy · Jason Reed, Benjamin C. Pierce
8. Experience report: Haskell as a reagent: results and observations on the use of Haskell in a python project · Iustin Pop
9. Experience report: growing programming languages for beginning students · Marcus Crestani, Michael Sperber
10. Fortifying macros · Ryan Culpepper, Matthias Felleisen
11. Functional parallel algorithms · Guy E. Blelloch
12. Functional pearl: every bit counts · Dimitrios Vytiniotis, Andrew J. Kennedy
13. Higher-order representation of substructural logics · Karl Crary
14. Instance chains: type class programming without overlapping instances · J. Garrett Morris, Mark P. Jones
15. Lazy tree splitting · Lars Bergstrom, Mike Rainey, John H. Reppy, Adam Shaw, Matthew Fluet
16. Logical types for untyped languages · Sam Tobin-Hochstadt, Matthias Felleisen
17. Lolliproc: to concurrency from classical linear logic via curry-howard and control · Karl Mazurak, Steve Zdancewic
18. ML: metalanguage or object language? · Michael J. C. Gordon
19. Matching lenses: alignment and view update · Davi M. J. Barbosa, Julien Cretin, Nate Foster, Michael Greenberg, Benjamin C. Pierce
20. Parametricity and dependent types · Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson
21. Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators · Stefan Holdermans, Jurriaan Hage
22. Program verification through characteristic formulae · Arthur Charguéraud
23. ReCaml: execution state as the cornerstone of reconfigurations · Jérémy Buisson, Fabien Dagnat
24. Regular, shape-polymorphic, parallel arrays in Haskell · Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Simon L. Peyton Jones, Ben Lippmeier
25. Rethinking supercompilation · Neil Mitchell
26. Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation · Edwin C. Brady, Kevin Hammond
27. Security-typed programming within dependently typed programming · Jamie Morgenstern, Daniel R. Licata
28. Semantic subtyping with an SMT solver · Gavin M. Bierman, Andrew D. Gordon, Catalin Hritcu, David E. Langworthy
29. Specifying and verifying sparse matrix codes · Gilad Arnold, Johannes Hölzl, Ali Sinan Köksal, Rastislav Bodík, Mooly Sagiv
30. TeachScheme!: a checkpoint · Matthias Felleisen
31. The gentle art of levitation · James Chapman, Pierre-Évariste Dagand, Conor McBride, Peter Morris
32. The impact of higher-order state and control effects on local relational reasoning · Derek Dreyer, Georg Neis, Lars Birkedal
33. The reduceron reconfigured · Matthew Naylor, Colin Runciman
34. Total parser combinators · Nils Anders Danielsson
35. Using functional programming within an industrial product group: perspectives and perceptions · David J. Scott, Richard Sharp, Thomas Gazagnaire, Anil Madhavapeddy
36. VeriML: typed computation of logical terms inside a language with effects · Antonis Stampoulis, Zhong Shao