• MORIHATA A. (2021). Lambda calculus with algebraic simplification for reduction parallelisation: Extended study. Journal of Functional Programming. 10.1017/S0956796821000058. 31.

    https://www.cambridge.org/core/product/identifier/S0956796821000058/type/journal_article

  • Navarro Leija O, Shiptoski K, Scott R, Wang B, Renner N, Newton R and Devietti J. Reproducible Containers. Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems. (167-182).

    https://doi.org/10.1145/3373376.3378519

  • Schiller L. (2020). Placement Strategies: Structured Skeleton Composition with Location-Aware Remote Data. Trends in Functional Programming. 10.1007/978-3-030-57761-2_11. (229-248).

    http://link.springer.com/10.1007/978-3-030-57761-2_11

  • Morihata A. (2019). Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning. Proceedings of the ACM on Programming Languages. 3:ICFP. (1-25). Online publication date: 26-Jul-2019.

    https://doi.org/10.1145/3341644

  • Belikov E, Loidl H and Michaelson G. (2019). Colocation of Potential Parallelism in a Distributed Adaptive Run-Time System for Parallel Haskell. Zivilgesellschaft und Wohlfahrtsstaat im Wandel. 10.1007/978-3-030-18506-0_1. (1-19).

    http://link.springer.com/10.1007/978-3-030-18506-0_1

  • Blöcker C and Hoffmann U. (2018). Pardis. The Journal of Supercomputing. 74:4. (1473-1484). Online publication date: 1-Apr-2018.

    https://doi.org/10.1007/s11227-018-2289-6

  • Barwell A, Brown C and Hammond K. (2018). Finding parallel functional pearls. Future Generation Computer Systems. 79:P2. (669-686). Online publication date: 1-Feb-2018.

    https://doi.org/10.1016/j.future.2017.07.024

  • Ishii H. (2018). A Purely Functional Computer Algebra System Embedded in Haskell. Developments in Language Theory. 10.1007/978-3-319-99639-4_20. (288-303).

    http://link.springer.com/10.1007/978-3-319-99639-4_20

  • Scott R, Navarro Leija O, Devietti J and Newton R. (2017). Monadic composition for deterministic, parallel batch processing. Proceedings of the ACM on Programming Languages. 1:OOPSLA. (1-26). Online publication date: 12-Oct-2017.

    https://doi.org/10.1145/3133897

  • Barwell A and Hammond K. In search of a map: using program slicing to discover potential parallelism in recursive functions. Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing. (30-41).

    https://doi.org/10.1145/3122948.3122951

  • Maier P. Why So Many?. Proceedings of the 1st International Workshop on Real World Domain Specific Languages. (1-2).

    https://doi.org/10.1145/2889420.2893172

  • Trilla J and Runciman C. (2015). Improving implicit parallelism. ACM SIGPLAN Notices. 50:12. (153-164). Online publication date: 28-Jan-2016.

    https://doi.org/10.1145/2887747.2804308

  • Walker M and Runciman C. (2015). Déjà Fu: a concurrency testing library for Haskell. ACM SIGPLAN Notices. 50:12. (141-152). Online publication date: 28-Jan-2016.

    https://doi.org/10.1145/2887747.2804306

  • SIVARAMAKRISHNAN K, HARRIS T, MARLOW S and PEYTON JONES S. (2016). Composable scheduler activations for Haskell. Journal of Functional Programming. 10.1017/S0956796816000071. 26.

    https://www.cambridge.org/core/product/identifier/S0956796816000071/type/journal_article

  • BERTHOLD J, LOIDL H and HAMMOND K. (2016). PAEAN: Portable and scalable runtime support for parallel Haskell dialects. Journal of Functional Programming. 10.1017/S0956796816000010. 26.

    https://www.cambridge.org/core/product/identifier/S0956796816000010/type/journal_article

  • Rocha R, Góes L and Pereira F. (2016). An Algebraic Framework for Parallelizing Recurrence in Functional Programming. Programming Languages. 10.1007/978-3-319-45279-1_10. (140-155).

    http://link.springer.com/10.1007/978-3-319-45279-1_10

  • Vießmann H, Scholz S, Šinkarovs A, Bainbridge B, Hamilton B and Flower S. Making fortran legacy code more functional. Proceedings of the 27th Symposium on the Implementation and Application of Functional Programming Languages. (1-13).

    https://doi.org/10.1145/2897336.2897348

  • Ertel S, Fetzer C and Felber P. Ohua. Proceedings of the Principles and Practices of Programming on The Java Platform. (51-64).

    https://doi.org/10.1145/2807426.2807431

  • Trilla J and Runciman C. Improving implicit parallelism. Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell. (153-164).

    https://doi.org/10.1145/2804302.2804308

  • Walker M and Runciman C. Déjà Fu: a concurrency testing library for Haskell. Proceedings of the 2015 ACM SIGPLAN Symposium on Haskell. (141-152).

    https://doi.org/10.1145/2804302.2804306

  • Totoo P and Loidl H. Lazy data-oriented evaluation strategies. Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing. (63-74).

    https://doi.org/10.1145/2636228.2636234

  • Totoo P and Loidl H. (2014). Parallel Haskell implementations of the N-body problem. Concurrency and Computation: Practice & Experience. 26:4. (987-1019). Online publication date: 25-Mar-2014.

    https://doi.org/10.1002/cpe.3087

  • Kuper L, Turon A, Krishnaswami N and Newton R. (2014). Freeze after writing. ACM SIGPLAN Notices. 49:1. (257-270). Online publication date: 13-Jan-2014.

    https://doi.org/10.1145/2578855.2535842

  • Kuper L, Turon A, Krishnaswami N and Newton R. Freeze after writing. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (257-270).

    https://doi.org/10.1145/2535838.2535842

  • Horstmeyer T and Loogen R. (2013). Graph-based communication in Eden. Higher-Order and Symbolic Computation. 26:1-4. (3-28). Online publication date: 1-Dec-2013.

    https://doi.org/10.1007/s10990-014-9101-y

  • Blanco M, Perdomo P, Ezzatti P, Pardo A and Viera M. Towards a functional run-time for dense NLA domain. Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing. (85-96).

    https://doi.org/10.1145/2502323.2502327

  • Kuper L and Newton R. LVars. Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing. (71-84).

    https://doi.org/10.1145/2502323.2502326

  • Aljabri M, Loidl H and Trinder P. The Design and Implementation of GUMSMP. Proceedings of the 25th symposium on Implementation and Application of Functional Languages. (37-48).

    https://doi.org/10.1145/2620678.2620682

  • Totoo P, Deligiannis P and Loidl H. Haskell vs. f# vs. scala. Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing. (49-60).

    https://doi.org/10.1145/2364474.2364483

  • Lobachev O. Parallel computation skeletons with premature termination property. Proceedings of the 11th international conference on Functional and Logic Programming. (197-212).

    https://doi.org/10.1007/978-3-642-29822-6_17

  • Leijen D, Fahndrich M and Burckhardt S. (2011). Prettier concurrency. ACM SIGPLAN Notices. 46:12. (83-94). Online publication date: 12-Jan-2012.

    https://doi.org/10.1145/2096148.2034686

  • Marlow S, Newton R and Peyton Jones S. (2011). A monad for deterministic parallelism. ACM SIGPLAN Notices. 46:12. (71-82). Online publication date: 12-Jan-2012.

    https://doi.org/10.1145/2096148.2034685

  • Lippmeier B and Keller G. (2011). Efficient parallel stencil convolution in Haskell. ACM SIGPLAN Notices. 46:12. (59-70). Online publication date: 12-Jan-2012.

    https://doi.org/10.1145/2096148.2034684

  • Petricek T, Mycroft A and Syme D. (2011). Extending monads with pattern matching. ACM SIGPLAN Notices. 46:12. (1-12). Online publication date: 12-Jan-2012.

    https://doi.org/10.1145/2096148.2034677

  • Aswad M, Trinder P and Loidl H. (2012). Architecture Aware Parallel Programming in Glasgow Parallel Haskell (GPH). Procedia Computer Science. 10.1016/j.procs.2012.04.199. 9. (1807-1816).

    http://linkinghub.elsevier.com/retrieve/pii/S1877050912003201

  • Trunfio G, D’Ambrosio D, Rongo R, Spataro W and Di Gregorio S. (2011). A New Algorithm for Simulating Wildfire Spread through Cellular Automata. ACM Transactions on Modeling and Computer Simulation. 22:1. (1-26). Online publication date: 1-Dec-2011.

    https://doi.org/10.1145/2043635.2043641

  • Powell W, Bouzaiene-Ayari B, Berger J, Boukhtouta A and George A. (2011). The Effect of Robust Decisions on the Cost of Uncertainty in Military Airlift Operations. ACM Transactions on Modeling and Computer Simulation. 22:1. (1-19). Online publication date: 1-Dec-2011.

    https://doi.org/10.1145/2043635.2043636

  • Burkhart M and Dimitropoulos X. (2008). Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice. ACM Transactions on Information and System Security. 14:4. (1-30). Online publication date: 1-Dec-2011.

    https://doi.org/10.1145/2043628.2043632

  • Li Y, Deng R, Lai J and Ma C. (2008). On two RFID privacy notions and their relations. ACM Transactions on Information and System Security. 14:4. (1-23). Online publication date: 1-Dec-2011.

    https://doi.org/10.1145/2043628.2043631

  • Maier P and Trinder P. Implementing a high-level distributed-memory parallel haskell in haskell. Proceedings of the 23rd international conference on Implementation and Application of Functional Languages. (35-50).

    https://doi.org/10.1007/978-3-642-34407-7_3

  • Leijen D, Fahndrich M and Burckhardt S. Prettier concurrency. Proceedings of the 4th ACM symposium on Haskell. (83-94).

    https://doi.org/10.1145/2034675.2034686

  • Marlow S, Newton R and Peyton Jones S. A monad for deterministic parallelism. Proceedings of the 4th ACM symposium on Haskell. (71-82).

    https://doi.org/10.1145/2034675.2034685

  • Petricek T, Mycroft A and Syme D. Extending monads with pattern matching. Proceedings of the 4th ACM symposium on Haskell. (1-12).

    https://doi.org/10.1145/2034675.2034677

  • Sabel D and Schmidt-Schauß M. A contextual semantics for concurrent Haskell with futures. Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming. (101-112).

    https://doi.org/10.1145/2003476.2003492

  • Yu L, Yeung S, Tang C, Terzopoulos D, Chan T and Osher S. (2011). Make it home. ACM Transactions on Graphics. 30:4. (1-12). Online publication date: 1-Jul-2011.

    https://doi.org/10.1145/2010324.1964981

  • Hammond K. Why parallel functional programming matters. Proceedings of the 16th Ada-Europe international conference on Reliable software technologies. (201-205).

    /doi/10.5555/2018027.2018050

  • Marlow S. Parallel and concurrent programming in Haskell. Proceedings of the 4th Summer School conference on Central European Functional Programming School. (339-401).

    https://doi.org/10.1007/978-3-642-32096-5_7

  • Loogen R. Eden --- parallel functional programming with haskell. Proceedings of the 4th Summer School conference on Central European Functional Programming School. (142-206).

    https://doi.org/10.1007/978-3-642-32096-5_4

  • Berthold J, Filinski A, Henglein F, Larsen K, Steffensen M and Vinter B. Functional high performance financial IT. Proceedings of the 12th international conference on Trends in Functional Programming. (98-113).

    https://doi.org/10.1007/978-3-642-32037-8_7

  • Brown C, Loidl H and Hammond K. ParaForming. Proceedings of the 12th international conference on Trends in Functional Programming. (82-97).

    https://doi.org/10.1007/978-3-642-32037-8_6

  • Aguado J and Mendler M. Computing with streams. Proceedings of the sixth workshop on Declarative aspects of multicore programming. (35-44).

    https://doi.org/10.1145/1926354.1926362

  • Hammond K. (2011). Why Parallel Functional Programming Matters: Panel Statement. Reliable Software Technologies - Ada-Europe 2011. 10.1007/978-3-642-21338-0_17. (201-205).

    http://link.springer.com/10.1007/978-3-642-21338-0_17

  • Huang Z, Hu B, Cheng H, Shen H, Liu H and Zhou X. (2010). Mining near-duplicate graph for cluster-based reranking of web video search results. ACM Transactions on Information Systems. 28:4. (1-27). Online publication date: 1-Nov-2010.

    https://doi.org/10.1145/1852102.1852108

  • Magalhães J and Rüger S. (2010). An information-theoretic framework for semantic-multimedia retrieval. ACM Transactions on Information Systems. 28:4. (1-32). Online publication date: 1-Nov-2010.

    https://doi.org/10.1145/1852102.1852105

  • Pasarella E, Vidal M, Zoltan C and Royo Sales J. (2024). A computational framework based on the dynamic pipeline approach. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2024.100966. 139. (100966). Online publication date: 1-Jun-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S2352220824000245

  • Belikov E, Loidl H and Michaelson G. (2019). Colocation of Potential Parallelism in a Distributed Adaptive Run-Time System for Parallel Haskell. Zivilgesellschaft und Wohlfahrtsstaat im Wandel. 10.1007/978-3-030-18506-0_1. (1-19).

    http://link.springer.com/10.1007/978-3-030-18506-0_1

  • Calderón Trilla J, Poulding S and Runciman C. (2015). Weaving Parallel Threads. Search-Based Software Engineering. 10.1007/978-3-319-22183-0_5. (62-76).

    https://link.springer.com/10.1007/978-3-319-22183-0_5

  • Duke D and Carr H. (2014). Computational Topology via Functional Programming: A Baseline Analysis. Topological Methods in Data Analysis and Visualization III. 10.1007/978-3-319-04099-8_5. (73-87).

    https://link.springer.com/10.1007/978-3-319-04099-8_5

  • González C and Fraguela B. (2013). A framework for argument-based task synchronization with automatic detection of dependencies. Parallel Computing. 10.1016/j.parco.2013.04.012. 39:9. (475-489). Online publication date: 1-Sep-2013.

    https://linkinghub.elsevier.com/retrieve/pii/S0167819113000562

  • Lobachev O. Parallel computation skeletons with premature termination property. Proceedings of the 11th international conference on Functional and Logic Programming. (197-212).

    https://doi.org/10.1007/978-3-642-29822-6_17

  • Maier P and Trinder P. Implementing a high-level distributed-memory parallel haskell in haskell. Proceedings of the 23rd international conference on Implementation and Application of Functional Languages. (35-50).

    https://doi.org/10.1007/978-3-642-34407-7_3