ICFP 2012
35 papers
- A generic abstract syntax model for embedded languages
- A meta-scheduler for the par-monad: composable scheduling for the heterogeneous cloud
- A traversal-based algorithm for higher-order model checking
- Addressing covert termination and timing channels in concurrent information flow systems
- Agda-curious?: an exploration of programming with dependent types
- An error-tolerant type system for variational lambda calculus
- Automatic amortised analysis of dynamic memory allocation for lazy functional programs
- Deconstraining DSLs
- Efficient lookup-table protocol in secure multiparty computation
- Elaborating intersection and union types
- Equality proofs and deferred type errors: a compiler pearl
- Experience report: Haskell in computational biology
- Experience report: a do-it-yourself high-assurance compiler
- Explicitly heterogeneous metaprogramming with MetaHaskell
- Formal verification of monad transformers
- Functional programming with structured graphs
- Functional programs that explain their work
- High performance embedded domain specific languages
- Introspective pushdown analysis of higher-order programs
- Nested data-parallelism on the gpu
- On the complexity of equivalence of specifications of infinite objects
- Operational semantics using the partiality monad
- Painless programming combining reduction and search: design principles for embedding decision procedures in high-level languages
- Practical typed lazy contracts
- Proof-producing synthesis of ML from higher-order logic
- Propositions as sessions
- Pure type systems with corecursion on streams: from finite to infinitary normalisation
- Shake before building: replacing make with haskell
- Sneaking around concatMap: efficient combinators for dynamic programming
- Superficially substructural types
- Tales from the jungle
- Transporting functions across ornaments
- Typing unmarshalling without marshalling types
- Verified heap theorem prover by paramodulation
- Work efficient higher-order vectorisation