ICFP A

41 papers

YearTitle / Authors
2011A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences.
Ki Yung Ahn, Tim Sheard
2011A kripke logical relation for effect-based program transformations.
Jacob Thamsborg, Lars Birkedal
2011A semantic model for graphical user interfaces.
Neelakantan R. Krishnaswami, Nick Benton
2011An efficient non-moving garbage collector for functional languages.
Katsuhiro Ueno, Atsushi Ohori, Toshiaki Otomo
2011An equivalence-preserving CPS translation via multi-language semantics.
Amal Ahmed, Matthias Blume
2011Balanced trees inhabiting functional parallel programming.
Akimasa Morihata, Kiminori Matsuzaki
2011Binders unbound.
Stephanie Weirich, Brent A. Yorgey, Tim Sheard
2011Characteristic formulae for the verification of imperative programs.
Arthur Charguéraud
2011Deriving an efficient FPGA implementation of a low density parity check forward error corrector.
Andy Gill, Andrew Farmer
2011Forest: a language and toolkit for programming with filestores.
Kathleen Fisher, Nate Foster, David Walker, Kenny Qili Zhu
2011Frenetic: a network programming language.
Nate Foster, Rob Harrison, Michael J. Freedman, Christopher Monsanto, Jennifer Rexford, Alec Story, David Walker
2011Functional modelling of musical harmony: an experience report.
José Pedro Magalhães, W. Bas de Haas
2011Functional programming through deep time: modeling the first complex ecosystems on earth.
Emily G. Mitchell
2011Generalising and dualising the third list-homomorphism theorem: functional pearl.
Shin-Cheng Mu, Akimasa Morihata
2011Geometry of synthesis iv: compiling affine recursion into static hardware.
Dan R. Ghica, Alex I. Smith, Satnam Singh
2011How to make ad hoc proof automation less ad hoc.
Georges Gonthier, Beta Ziliani, Aleksandar Nanevski, Derek Dreyer
2011Implicit self-adjusting computation for purely functional programs.
Yan Chen, Jana Dunfield, Matthew A. Hammer, Umut A. Acar
2011Incremental updates for efficient bidirectional transformations.
Meng Wang, Jeremy Gibbons, Nicolas Wu
2011Just do it: simple monadic equational reasoning.
Jeremy Gibbons, Ralf Hinze
2011Lightweight monadic programming in ML.
Nikhil Swamy, Nataliya Guts, Daan Leijen, Michael Hicks
2011Linearity and PCF: a semantic insight!
Marco Gaboardi, Luca Paolini, Mauro Piccolo
2011Making standard ML a practical database programming language.
Atsushi Ohori, Katsuhiro Ueno
2011Modular rollback through control logging: a pair of twin functional pearls.
Olin Shivers, Aaron Joseph Turon
2011Modular verification of preemptive OS kernels.
Alexey Gotsman, Hongseok Yang
2011Monads, zippers and views: virtualizing the monad stack.
Tom Schrijvers, Bruno C. d. S. Oliveira
2011Nameless, painless.
Nicolas Pouillard
2011On the bright side of type classes: instance arguments in Agda.
Dominique Devriese, Frank Piessens
2011Parametric polymorphism and semantic subtyping: the logical connection.
Nils Gesbert, Pierre Genevès, Nabil Layaïda
2011Parsing with derivatives: a functional pearl.
Matthew Might, David Darais, Daniel Spiewak
2011Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, ICFP 2011, Tokyo, Japan, September 19-21, 2011
Manuel M. T. Chakravarty, Zhenjiang Hu, Olivier Danvy
2011Programming assurance cases in Agda.
Makoto Takeyama
2011Proving the unique fixed-point principle correct: an adventure with category theory.
Ralf Hinze, Daniel W. H. James
2011Pushdown flow analysis of first-class control.
Dimitrios Vardoulakis, Olin Shivers
2011Recursion principles for syntax with bindings and substitution.
Andrei Popescu, Elsa L. Gunter
2011Secure distributed programming with value-dependent types.
Nikhil Swamy, Juan Chen, Cédric Fournet, Pierre-Yves Strub, Karthikeyan Bhargavan, Jean Yang
2011Set-theoretic foundation of parametric polymorphism and subtyping.
Giuseppe Castagna, Zhiwu Xu
2011Subtyping delimited continuations.
Marek Materzok, Dariusz Biernacki
2011Temporal higher-order contracts.
Tim Disney, Cormac Flanagan, Jay McCarthy
2011Towards a comprehensive theory of monadic effects.
Andrzej Filinski
2011Typed self-interpretation by pattern matching.
C. Barry Jay, Jens Palsberg
2011Using camlp4 for presenting dynamic mathematics on the web: DynaMoW, an OCaml language extension for the run-time generation of mathematical contents and their presentation on the web.
Frédéric Chyzak, Alexis Darrasse