ICFP A

36 papers

YearTitle / Authors
2012A generic abstract syntax model for embedded languages.
Emil Axelsson
2012A meta-scheduler for the par-monad: composable scheduling for the heterogeneous cloud.
Adam Foltzer, Abhishek Kulkarni, Rebecca Swords, Sajith Sasidharan, Eric Jiang, Ryan Newton
2012A traversal-based algorithm for higher-order model checking.
Robin P. Neatherway, Steven J. Ramsay, C.-H. Luke Ong
2012ACM SIGPLAN International Conference on Functional Programming, ICFP'12, Copenhagen, Denmark, September 9-15, 2012
Peter Thiemann, Robby Bruce Findler
2012Addressing covert termination and timing channels in concurrent information flow systems.
Deian Stefan, Alejandro Russo, Pablo Buiras, Amit Levy, John C. Mitchell, David Mazières
2012Agda-curious?: an exploration of programming with dependent types.
Conor Thomas McBride
2012An error-tolerant type system for variational lambda calculus.
Sheng Chen, Martin Erwig, Eric Walkingshaw
2012Automatic amortised analysis of dynamic memory allocation for lazy functional programs.
Hugo R. Simões, Pedro B. Vasconcelos, Mário Florido, Steffen Jost, Kevin Hammond
2012Deconstraining DSLs.
Will Jones, Tony Field, Tristan Oliver Richard Allwood
2012Efficient lookup-table protocol in secure multiparty computation.
John Launchbury, Iavor S. Diatchki, Thomas Dubuisson, Andy Adams-Moran
2012Elaborating intersection and union types.
Jana Dunfield
2012Equality proofs and deferred type errors: a compiler pearl.
Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães
2012Experience report: Haskell in computational biology.
Noah M. Daniels, Andrew Gallant, Norman Ramsey
2012Experience report: a do-it-yourself high-assurance compiler.
Lee Pike, Nis Wegmann, Sebastian Niller, Alwyn Goodloe
2012Explicitly heterogeneous metaprogramming with MetaHaskell.
Geoffrey Mainland
2012Formal verification of monad transformers.
Brian Huffman
2012Functional programming with structured graphs.
Bruno C. d. S. Oliveira, William R. Cook
2012Functional programs that explain their work.
Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy
2012High performance embedded domain specific languages.
Kunle Olukotun
2012Introspective pushdown analysis of higher-order programs.
Christopher Earl, Ilya Sergey, Matthew Might, David Van Horn
2012Nested data-parallelism on the gpu.
Lars Bergstrom, John H. Reppy
2012On the complexity of equivalence of specifications of infinite objects.
Jörg Endrullis, Dimitri Hendriks, Rena Bakhshi
2012Operational semantics using the partiality monad.
Nils Anders Danielsson
2012Painless programming combining reduction and search: design principles for embedding decision procedures in high-level languages.
Timothy E. Sheard
2012Practical typed lazy contracts.
Olaf Chitil
2012Proof-producing synthesis of ML from higher-order logic.
Magnus O. Myreen, Scott Owens
2012Propositions as sessions.
Philip Wadler
2012Pure type systems with corecursion on streams: from finite to infinitary normalisation.
Paula Severi, Fer-Jan de Vries
2012Shake before building: replacing make with haskell.
Neil Mitchell
2012Sneaking around concatMap: efficient combinators for dynamic programming.
Christian Höner zu Siederdissen
2012Superficially substructural types.
Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg
2012Tales from the jungle.
Peter Sewell
2012Transporting functions across ornaments.
Pierre-Évariste Dagand, Conor McBride
2012Typing unmarshalling without marshalling types.
Grégoire Henry, Michel Mauny, Emmanuel Chailloux, Pascal Manoury
2012Verified heap theorem prover by paramodulation.
Gordon Stewart, Lennart Beringer, Andrew W. Appel
2012Work efficient higher-order vectorisation.
Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, Simon L. Peyton Jones