![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
17th ICFP 2012: Copenhagen, Denmark
- Peter Thiemann, Robby Bruce Findler:
ACM SIGPLAN International Conference on Functional Programming, ICFP'12, Copenhagen, Denmark, September 9-15, 2012. ACM 2012, ISBN 978-1-4503-1054-3
Keynote address
- Conor Thomas McBride:
Agda-curious?: an exploration of programming with dependent types. 1-2
Automated theorem proving
- Gordon Stewart, Lennart Beringer, Andrew W. Appel
:
Verified heap theorem prover by paramodulation. 3-14 - Brian Huffman:
Formal verification of monad transformers. 15-16
Types
- Jana Dunfield:
Elaborating intersection and union types. 17-28 - Sheng Chen, Martin Erwig, Eric Walkingshaw:
An error-tolerant type system for variational lambda calculus. 29-40 - Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg:
Superficially substructural types. 41-54
Embedded languages
- Neil Mitchell:
Shake before building: replacing make with haskell. 55-66 - Olaf Chitil:
Practical typed lazy contracts. 67-76
Programming with graphs and search
- Bruno C. d. S. Oliveira, William R. Cook
:
Functional programming with structured graphs. 77-88 - Timothy E. Sheard:
Painless programming combining reduction and search: design principles for embedding decision procedures in high-level languages. 89-102
Ornaments, extraction, and semantics
- Pierre-Évariste Dagand, Conor McBride
:
Transporting functions across ornaments. 103-114 - Magnus O. Myreen, Scott Owens
:
Proof-producing synthesis of ML from higher-order logic. 115-126 - Nils Anders Danielsson:
Operational semantics using the partiality monad. 127-138
Keynote address 2
- Kunle Olukotun
:
High performance embedded domain specific languages. 139-140
Infinity
- Paula Severi, Fer-Jan de Vries:
Pure type systems with corecursion on streams: from finite to infinitary normalisation. 141-152 - Jörg Endrullis
, Dimitri Hendriks, Rena Bakhshi
:
On the complexity of equivalence of specifications of infinite objects. 153-164
Analysis
- Hugo R. Simões, Pedro B. Vasconcelos
, Mário Florido
, Steffen Jost, Kevin Hammond
:
Automatic amortised analysis of dynamic memory allocation for lazy functional programs. 165-176 - Christopher Earl, Ilya Sergey
, Matthew Might, David Van Horn
:
Introspective pushdown analysis of higher-order programs. 177-188
Security
- John Launchbury, Iavor S. Diatchki, Thomas DuBuisson, Andy Adams-Moran:
Efficient lookup-table protocol in secure multiparty computation. 189-200 - Deian Stefan, Alejandro Russo
, Pablo Buiras, Amit Levy
, John C. Mitchell
, David Mazières:
Addressing covert termination and timing channels in concurrent information flow systems. 201-214
FP in biology
- Christian Höner zu Siederdissen
:
Sneaking around concatMap: efficient combinators for dynamic programming. 215-226 - Noah M. Daniels, Andrew Gallant, Norman Ramsey
:
Experience report: Haskell in computational biology. 227-234
Parallelism
- Adam Foltzer, Abhishek Kulkarni
, Rebecca Swords, Sajith Sasidharan, Eric Jiang, Ryan Newton:
A meta-scheduler for the par-monad: composable scheduling for the heterogeneous cloud. 235-246 - Lars Bergstrom, John H. Reppy
:
Nested data-parallelism on the gpu. 247-258 - Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller
, Roman Leshchinskiy, Simon L. Peyton Jones:
Work efficient higher-order vectorisation. 259-270
Keynote address 3
- Peter Sewell
:
Tales from the jungle. 271-272
Curry-Howard and compatibility checking
- Philip Wadler:
Propositions as sessions. 273-286 - Grégoire Henry, Michel Mauny, Emmanuel Chailloux, Pascal Manoury:
Typing unmarshalling without marshalling types. 287-298
DSL support
- Will Jones, Tony Field, Tristan Oliver Richard Allwood:
Deconstraining DSLs. 299-310 - Geoffrey Mainland
:
Explicitly heterogeneous metaprogramming with MetaHaskell. 311-322 - Emil Axelsson:
A generic abstract syntax model for embedded languages. 323-334
Compilers
- Lee Pike, Nis Wegmann, Sebastian Niller, Alwyn Goodloe:
Experience report: a do-it-yourself high-assurance compiler. 335-340 - Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães:
Equality proofs and deferred type errors: a compiler pearl. 341-352
Higher-order model checking and slicing
- Robin P. Neatherway, Steven J. Ramsay
, C.-H. Luke Ong
:
A traversal-based algorithm for higher-order model checking. 353-364 - Roly Perera, Umut A. Acar, James Cheney
, Paul Blain Levy:
Functional programs that explain their work. 365-376
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.