Proceedings of the 31st Symposium on Implementation and Application of Functional Languages最新文献_第2页

Shapes and flattening 形状和平坦化

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412946

John H. Reppy, J. Wingerter

{"title":"Shapes and flattening","authors":"John H. Reppy, J. Wingerter","doi":"10.1145/3412932.3412946","DOIUrl":"https://doi.org/10.1145/3412932.3412946","url":null,"abstract":"Nesl is a first-order functional language with an apply-to-each construct and other parallel primitives that enables the expression of irregular nested data-parallel (NDP) algorithms. To compile Nesl, Blelloch and others developed a global flattening transformation that maps irregular NDP code into regular flat data parallel (FDP) code suitable for executing on SIMD or SIMT architectures, such as GPUs. While flattening solves the problem of mapping irregular parallelism into a regular model, it requires significant additional optimizations to produce performant code. Nessie is a compiler for Nesl that generates CUDA code for running on Nvidia GPUs. The Nessie compiler relies on a fairly complicated shape analysis that is performed on the FDP code produced by the flattening transformation. Shape analysis plays a key rôle in the compiler as it is the enabler of fusion optimizations, smart kernel scheduling, and other optimizations. In this paper, we present a new approach to the shape analysis problem for Nesl that is both simpler to implement and provides better quality shape information. The key idea is to analyze the NDP representation of the program and then preserve shape information through the flattening transformation.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117259805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A functional approach to accelerating Monte Carlo based american option pricing 一种加速基于蒙特卡洛的美式期权定价的功能方法

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412937

W. Pawlak, M. Elsman

引用次数: 0

Tensor comprehensions in SaC SaC中的张量推导

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412947

S. Scholz, Artjoms Šinkarovs

引用次数: 4

Language-integrated updatable views 语言集成的可更新视图

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412945

Rudi Horn, S. Fowler, J. Cheney

{"title":"Language-integrated updatable views","authors":"Rudi Horn, S. Fowler, J. Cheney","doi":"10.1145/3412932.3412945","DOIUrl":"https://doi.org/10.1145/3412932.3412945","url":null,"abstract":"Relational lenses are a modern approach to the view update problem in relational databases. As introduced by Bohannon et al. [5], relational lenses allow the definition of updatable views by the composition of lenses performing individual transformations. Horn et al. [20] provided the first implementation of incremental relational lenses, which demonstrated that relational lenses can be implemented efficiently by propagating changes to the database rather than replacing the entire database state. However, neither approach proposes a concrete language design; consequently, it is unclear how to integrate lenses into a general-purpose programming language, or how to check that lenses satisfy the well-formedness conditions needed for predictable behaviour. In this paper, we propose the first full account of relational lenses in a functional programming language, by extending the Links web programming language. We provide support for higher-order predicates, and provide the first account of typechecking relational lenses which is amenable to implementation. We prove the soundness of our typing rules, and illustrate our approach by implementing a curation interface for a scientific database application.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127155808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Interpreting task oriented programs on tiny computers 在微型计算机上解释面向任务的程序

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412936

Mart Lubbers, P. Koopman, M. J. Plasmeijer

{"title":"Interpreting task oriented programs on tiny computers","authors":"Mart Lubbers, P. Koopman, M. J. Plasmeijer","doi":"10.1145/3412932.3412936","DOIUrl":"https://doi.org/10.1145/3412932.3412936","url":null,"abstract":"Small Microcontroller Units (MCUs) drive the omnipresent Internet of Things (IoT). These devices are small, cheap, and energy efficient. However, they are not very powerful and lack an Operating System. Hence it is difficult to apply high level abstractions and write software that stays close to the design. Task Oriented Programming (TOP) is a paradigm for creating multi-user collaborative systems. A program consists of tasks---descriptions of what needs to be done. The tasks represent the actual work and a task value is observable during execution. Furthermore, tasks can be combined and transformed using combinators. mTask is an embedded Domain Specific Language (eDSL) to program MCUs following the TOP paradigm. Previous work has described the mTask language, a static C code generator, and how to integrate mTask with TOP servers. This paper shows that for dynamic IOT applications, tasks must be sent at runtime to the devices for interpretation. It describes in detail how to compile specialized IOT TOP tasks to bytecode and how to interpret them on devices with very little memory. These additions allow the creation of complete, dynamic IOT applications arising from a single source using a mix of iTasks and mTask tasks. Details such as serialization and communication are captured in simple abstractions.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114916244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Counting immutable beans: reference counting optimized for purely functional programming 计数不可变bean:为纯函数式编程优化的引用计数

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-08-01 DOI: 10.1145/3412932.3412935

Sebastian Ullrich, L. D. Moura

引用次数: 16