Abstract is missing.
- TensorFlow: learning functions at scaleMartín Abadi. 1 [doi]
- Journey to find bugs in JavaScript web applications in the wildSukyoung Ryu. 2 [doi]
- A functional programmer's guide to homotopy type theoryDan Licata. 3 [doi]
- Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphismsDavid Castro, Kevin Hammond, Susmit Sarkar. 4-17 [doi]
- Dag-calculus: a calculus for parallel computationUmut A. Acar, Arthur Charguéraud, Mike Rainey, Filip Sieczkowski. 18-32 [doi]
- A lambda-calculus foundation for universal probabilistic programmingJohannes Borgström, Ugo Dal Lago, Andrew D. Gordon, Marcin Szymczak. 33-46 [doi]
- Deriving a probability density calculator (functional pearl)Wazim Mohammed Ismail, Chung-chieh Shan. 47-59 [doi]
- A new verified compiler backend for CakeMLYong Kiam Tan, Magnus O. Myreen, Ramana Kumar, Anthony C. J. Fox, Scott Owens, Michael Norrish. 60-73 [doi]
- Sequent calculus as a compiler intermediate languagePaul Downen, Luke Maurer, Zena M. Ariola, Simon L. Peyton Jones. 74-88 [doi]
- Refinement through restraint: bringing down the cost of verificationLiam O'Connor, Zilin Chen, Christine Rizkallah, Sidney Amani, Japheth Lim, Toby C. Murray, Yutaka Nagashima, Thomas Sewell, Gerwin Klein. 89-102 [doi]
- Fully abstract compilation via universal embeddingMax S. New, William J. Bowman, Amal Ahmed. 103-116 [doi]
- Oh Lord, please don't let contracts be misunderstood (functional pearl)Christos Dimoulas, Max S. New, Robby Findler, Matthias Felleisen. 117-131 [doi]
- A type theory for incremental computational complexity with control flow changesEzgi Çiçek, Zoe Paraskevopoulou, Deepak Garg 0001. 132-145 [doi]
- Compact bit encoding schemes for simply-typed lambda-termsKotaro Takeda, Naoki Kobayashi 0001, Kazuya Yaguchi, Ayumi Shinohara. 146-157 [doi]
- Queueing and glueing for optimal partitioning (functional pearl)Shin-Cheng Mu, Yu-Hsi Chiang, Yu-Han Lyu. 158-167 [doi]
- All sorts of permutations (functional pearl)Jan Christiansen, Nikita Danilenko, Sandra Dylus. 168-179 [doi]
- A glimpse of HopjsManuel Serrano, Vincent Prunet. 180-192 [doi]
- Experience report: growing and shrinking polygons for random testing of computational geometry algorithmsIlya Sergey. 193-199 [doi]
- Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processingKento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Akimasa Morihata, Hideya Iwasaki. 200-213 [doi]
- Datafun: a functional DatalogMichael Arntzenius, Neelakantan R. Krishnaswami. 214-227 [doi]
- Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong)Eric L. Seidel, Ranjit Jhala, Westley Weimer. 228-242 [doi]
- Automatically disproving fair termination of higher-order functional programsKeiichi Watanabe, Ryosuke Sato, Takeshi Tsukada, Naoki Kobayashi 0001. 243-255 [doi]
- Higher-order ghost stateRalf Jung 0002, Robbert Krebbers, Lars Birkedal, Derek Dreyer. 256-269 [doi]
- Unifiers as equivalences: proof-relevant unification of dependently typed dataJesper Cockx, Dominique Devriese, Frank Piessens. 270-283 [doi]
- Elaborator reflection: extending Idris in IdrisDavid Christiansen, Edwin Brady. 284-297 [doi]
- Partial type equivalences for verified dependent interoperabilityPierre-Évariste Dagand, Nicolas Tabareau, Éric Tanter. 298-310 [doi]
- Constructive Galois connections: taming the Galois connection framework for mechanized metatheoryDavid Darais, David Van Horn. 311-324 [doi]
- An abstract memory functor for verified C static analyzersSandrine Blazy, Vincent Laporte, David Pichardie. 325-337 [doi]
- Ghostbuster: a tool for simplifying and converting GADTsTrevor L. McDonell, Timothy A. K. Zakian, Matteo Cimini, Ryan R. Newton. 338-350 [doi]
- Indexed codata typesDavid Thibodeau, Andrew Cave, Brigitte Pientka. 351-363 [doi]
- Disjoint intersection typesBruno C. D. S. Oliveira, Zhiyuan Shi, João Alpuim. 364-377 [doi]
- Set-theoretic types for polymorphic variantsGiuseppe Castagna, Tommaso Petrucciani, Kim Nguyen 0001. 378-391 [doi]
- Hierarchical memory management for parallel programsRam Raghunathan, Stefan K. Muller, Umut A. Acar, Guy E. Blelloch. 392-406 [doi]
- Allocation characterizes polyvariance: a unified methodology for polyvariant control-flow analysisThomas Gilray, Michael D. Adams 0001, Matthew Might. 407-420 [doi]
- A fully concurrent garbage collector for functional programs on multicore processorsKatsuhiro Ueno, Atsushi Ohori. 421-433 [doi]
- Talking bananas: structural recursion for session typesSam Lindley, J. Garrett Morris. 434-447 [doi]
- The best of both worlds: linear functional programming without compromiseJ. Garrett Morris. 448-461 [doi]
- Context-free session typesPeter Thiemann, Vasco T. Vasconcelos. 462-475 [doi]
- Combining effects and coeffects via gradingMarco Gaboardi, Shin-ya Katsumata, Dominic A. Orchard, Flavien Breuvart, Tarmo Uustalu. 476-489 [doi]
- String diagrams for free monads (functional pearl)Maciej Piróg, Nicolas Wu. 490-501 [doi]