Abstract is missing.
- Interactive programming with dependent typesUlf Norell. 1-2 [doi]
- Verified decision procedures for MSO on words based on derivatives of regular expressionsDmitriy Traytel, Tobias Nipkow. 3-12 [doi]
- C-SHORe: a collapsible approach to higher-order verificationChristopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre. 13-24 [doi]
- Automatic SIMD vectorization for HaskellLeaf Petersen, Dominic A. Orchard, Neal Glew. 25-36 [doi]
- Exploiting vector instructions with generalized stream fusioGeoffrey Mainland, Roman Leshchinskiy, Simon L. Peyton Jones. 37-48 [doi]
- Optimising purely functional GPU programsTrevor L. McDonell, Manuel M. T. Chakravarty, Gabriele Keller, Ben Lippmeier. 49-60 [doi]
- Type-theory in colorJean-Philippe Bernardy, Guilhem Moulin. 61-72 [doi]
- Typed syntactic meta-programmingDominique Devriese, Frank Piessens. 73-86 [doi]
- Mtac: a monad for typed tactic programming in CoqBeta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis. 87-100 [doi]
- Fun with semirings: a functional pearl on the abuse of linear algebraStephen Dolan. 101-110 [doi]
- Efficient divide-and-conquer parsing of practical context-free languagesJean-Philippe Bernardy, Koen Claessen. 111-122 [doi]
- Functional geometry and the Traité de Lutherie: functional pearlHarry G. Mairson. 123-132 [doi]
- Programming and reasoning with algebraic effects and dependent typesEdwin Brady. 133-144 [doi]
- Handlers in actionOhad Kammar, Sam Lindley, Nicolas Oury. 145-158 [doi]
- Computer science as a school subjectSimon L. Peyton Jones. 159-160 [doi]
- Correctness of an STM Haskell implementationManfred Schmidt-Schauß, David Sabel. 161-172 [doi]
- Programming with permissions in MezzoFrançois Pottier, Jonathan Protzenko. 173-184 [doi]
- Wellfounded recursion with copatterns: a unified approach to termination and productivityAndreas Abel 0001, Brigitte Pientka. 185-196 [doi]
- Productive coprogramming with guarded recursionRobert Atkey, Conor McBride. 197-208 [doi]
- Unifying structured recursion schemesRalf Hinze, Nicolas Wu, Jeremy Gibbons. 209-220 [doi]
- Higher-order functional reactive programming without spacetime leaksNeelakantan R. Krishnaswami. 221-232 [doi]
- Functional reactive programming with liveness guaranteesAlan Jeffrey. 233-244 [doi]
- A short cut to parallelization theoremsAkimasa Morihata. 245-256 [doi]
- Using circular programs for higher-order syntax: functional pearlEmil Axelsson, Koen Claessen. 257-262 [doi]
- Weak optimality, and the meaning of sharingThibaut Balabonski. 263-274 [doi]
- System FC with explicit kind equalityStephanie Weirich, Justin Hsu, Richard A. Eisenberg. 275-286 [doi]
- The constrained-monad problemNeil Sculthorpe, Jan Bracker, George Giorgidze, Andy Gill. 287-298 [doi]
- Simple and compositional reification of monadic embedded languagesJosef Svenningsson, Bo Joel Svensson. 299-304 [doi]
- Structural recursion for querying ordered graphsSoichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato, Keisuke Nakano. 305-318 [doi]
- Modular monadic meta-theoryBenjamin Delaware, Steven Keuchel, Tom Schrijvers, Bruno C. D. S. Oliveira. 319-330 [doi]
- Modular and automated type-soundness verification for language extensionsFlorian Lorenzen, Sebastian Erdweg. 331-342 [doi]
- A nanopass framework for commercial compiler developmentAndrew W. Keep, R. Kent Dybvig. 343-350 [doi]
- Experience report: applying random testing to a base type environmentVincent St-Amour, Neil Toronto. 351-356 [doi]
- Experience report: functional programming of mHealth applicationsChris Petersen, Matthias Gorges, Dustin Dunsmuir, J. Mark Ansermino, Guy A. Dumont. 357-362 [doi]
- Hoare-style reasoning with (algebraic) continuationsGermán Andrés Delbianco, Aleksandar Nanevski. 363-376 [doi]
- Unifying refinement and hoare-style reasoning in a logic for higher-order concurrencyAaron Turon, Derek Dreyer, Lars Birkedal. 377-390 [doi]
- The bedrock structured programming system: combining generative metaprogramming and hoare logic in an extensible program verifierAdam J. Chlipala. 391-402 [doi]
- A practical theory of language-integrated queryJames Cheney, Sam Lindley, Philip Wadler. 403-416 [doi]
- Calculating threesomes, with blameRonald Garcia. 417-428 [doi]
- Complete and easy bidirectional typechecking for higher-rank polymorphismJoshua Dunfield, Neelakantan R. Krishnaswami. 429-442 [doi]
- Optimizing abstract abstract machinesJ. Ian Johnson, Nicholas Labich, Matthew Might, David Van Horn. 443-454 [doi]
- Testing noninterference, quicklyCatalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim, Leonidas Lampropoulos. 455-468 [doi]