Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming最新文献_第2页

Two notions of sub-behaviour for session-based client/server systems: 10 Years Later 基于会话的客户机/服务器系统的两个子行为概念:10年后

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-09-08 DOI: 10.1145/3414080.3414082

F. Barbanera, Ugo de'Liguoro

引用次数: 0

Declarative abstractions for tensor program partitioning 张量程序划分的声明性抽象

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-09-08 DOI: 10.1145/3414080.3414105

Dimitrios Vytiniotis

{"title":"Declarative abstractions for tensor program partitioning","authors":"Dimitrios Vytiniotis","doi":"10.1145/3414080.3414105","DOIUrl":"https://doi.org/10.1145/3414080.3414105","url":null,"abstract":"The size of state-of-the-art machine learning models is continuously growing; for instance GPT-3, a recent language model trained by OpenAI, contains 175B parameters. Due to memory limitations and scalability constraints hardware acceleration for such models relies on configuring them as systems of accelerator devices (such as GPUs, or TPUs, or even simple compute cores with fast local memory) with custom interconnect networks. This setting poses a challenge for software: there is an increasing need for flexible ways to distribute these multi-dimensional array programs (tensor programs) across systems of accelerator devices. We outline in this talk how ideas from deforestation and stream fusion are relevant for the domain of tensor programming and partitioning. Specifically, we see how the concept of array “builders”, aiming primarily at code generation, can be extended to array “slicers”. Array slicers, together with algebraic representations of range objects and declarative rewrite rules, can express a variety of different and accelerator-agnostic distribution strategies. We will see how a tensor IR can be extended with such abstractions, how we can drive partitioning through user annotations or interactive tactics, and – as a demonstration – how it may be lowered to a low-level executable dataflow graph of SPMD kernels. We will finally discuss some remaining hard problems and further transformations that are essential for scaling up models on systems of accelerators, and where ideas from declarative programming could prove useful.","PeriodicalId":328721,"journal":{"name":"Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127688415","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}

引用次数: 3

Hailstorm: A Statically-Typed, Purely Functional Language for IoT Applications 冰雹:一种用于物联网应用的静态类型、纯函数式语言

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-09-08 DOI: 10.1145/3414080.3414092

Abhiroop Sarkar, M. Sheeran

{"title":"Hailstorm: A Statically-Typed, Purely Functional Language for IoT Applications","authors":"Abhiroop Sarkar, M. Sheeran","doi":"10.1145/3414080.3414092","DOIUrl":"https://doi.org/10.1145/3414080.3414092","url":null,"abstract":"With the growing ubiquity of Internet of Things (IoT), more complex logic is being programmed on resource-constrained IoT devices, almost exclusively using the C programming language. While C provides low-level control over memory, it lacks a number of high-level programming abstractions such as higher-order functions, polymorphism, strong static typing, memory safety, and automatic memory management. We present Hailstorm, a statically-typed, purely functional programming language that attempts to address the above problem. It is a high-level programming language with a strict typing discipline. It supports features like higher-order functions, tail-recursion, and automatic memory management, to program IoT devices in a declarative manner. Applications running on these devices tend to be heavily dominated by I/O. Hailstorm tracks side effects like I/O in its type system using resource types. This choice allowed us to explore the design of a purely functional standalone language, in an area where it is more common to embed a functional core in an imperative shell. The language borrows the combinators of arrowized FRP, but has discrete-time semantics. The design of the full set of combinators is work in progress, driven by examples. So far, we have evaluated Hailstorm by writing standard examples from the literature (earthquake detection, a railway crossing system and various other clocked systems), and also running examples on the GRiSP embedded systems board, through generation of Erlang.","PeriodicalId":328721,"journal":{"name":"Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126426090","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}

引用次数: 5

Moulinog: A Generator of Random Student Assignments Written in Prolog Moulinog:一个用Prolog写的随机学生作业生成器

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-09-08 DOI: 10.1145/3414080.3414100

Gonzague Yernaux, Wim Vanhoof, L. Schumacher

引用次数: 0

Proof-Carrying Plans: a Resource Logic for AI Planning 论证计划:AI规划的资源逻辑

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-08-10 DOI: 10.1145/3414080.3414094

Alasdair Hill, Ekaterina Komendantskaya, Ronald P. A. Petrick

{"title":"Proof-Carrying Plans: a Resource Logic for AI Planning","authors":"Alasdair Hill, Ekaterina Komendantskaya, Ronald P. A. Petrick","doi":"10.1145/3414080.3414094","DOIUrl":"https://doi.org/10.1145/3414080.3414094","url":null,"abstract":"Planning languages have been used successfully in AI for several decades. Recent trends in AI verification and Explainable AI have raised the question of whether AI planning techniques can be verified. In this paper, we present a novel resource logic, the Proof Carrying Plans (PCP) logic that can be used to verify plans produced by AI planners. The PCP logic takes inspiration from existing resource logics (such as Linear logic and Separation logic) as well as Hoare logic when it comes to modelling states and resource-aware plan execution. It also capitalises on the Curry-Howard approach to logics, in its treatment of plans as functions and plan pre- and post-conditions as types. This paper presents two main results. From the theoretical perspective, we show that the PCP logic is sound relative to the standard possible world semantics used in AI planning. From the practical perspective, we present a complete Agda formalisation of the PCP logic and of its soundness proof. Moreover, we showcase the Curry-Howard, or functional, value of this implementation by supplementing it with the library that parses AI plans into Agda’s proofs automatically. We provide evaluation of this library and the resulting Agda functions. Keywords: AI planning, Verification, Resource Logics, Theorem Proving, Dependent Types.","PeriodicalId":328721,"journal":{"name":"Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127798971","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

Understanding Lua’s Garbage Collection: Towards a Formalized Static Analyzer 理解Lua的垃圾收集:走向形式化的静态分析器

Proceedings of the 22nd International Symposium on Principles and Practice of Declarative Programming Pub Date : 2020-05-26 DOI: 10.1145/3414080.3414093

Mallku Soldevila, Beta Ziliani, Daniel Fridlender

引用次数: 2