Log. Methods Comput. Sci.最新文献_第6页

Tameness and the power of programs over monoids in DA DA中程序对一元群的驯服性和威力

Log. Methods Comput. Sci. Pub Date : 2021-01-19 DOI: 10.46298/lmcs-18(3:14)2022

Nathan Grosshans, P. McKenzie, L. Segoufin

引用次数: 6

Higher Order Automatic Differentiation of Higher Order Functions 高阶函数的高阶自动微分

Log. Methods Comput. Sci. Pub Date : 2021-01-17 DOI: 10.46298/lmcs-18(1:41)2022

Mathieu Huot, S. Staton, Matthijs V'ak'ar

引用次数: 13

Parametricity for Nested Types and GADTs 嵌套类型和gadt的参数化

Log. Methods Comput. Sci. Pub Date : 2021-01-13 DOI: 10.46298/lmcs-17(4:23)2021

Patricia Johann, Enrico Ghiorzi, D. Jeffries

{"title":"Parametricity for Nested Types and GADTs","authors":"Patricia Johann, Enrico Ghiorzi, D. Jeffries","doi":"10.46298/lmcs-17(4:23)2021","DOIUrl":"https://doi.org/10.46298/lmcs-17(4:23)2021","url":null,"abstract":"This paper considers parametricity and its consequent free theorems for\u0000nested data types. Rather than representing nested types via their Church\u0000encodings in a higher-kinded or dependently typed extension of System F, we\u0000adopt a functional programming perspective and design a Hindley-Milner-style\u0000calculus with primitives for constructing nested types directly as fixpoints.\u0000Our calculus can express all nested types appearing in the literature,\u0000including truly nested types. At the level of terms, it supports primitive\u0000pattern matching, map functions, and fold combinators for nested types. Our\u0000main contribution is the construction of a parametric model for our calculus.\u0000This is both delicate and challenging. In particular, to ensure the existence\u0000of semantic fixpoints interpreting nested types, and thus to establish a\u0000suitable Identity Extension Lemma for our calculus, our type system must\u0000explicitly track functoriality of types, and cocontinuity conditions on the\u0000functors interpreting them must be appropriately threaded throughout the model\u0000construction. We also prove that our model satisfies an appropriate Abstraction\u0000Theorem, as well as that it verifies all standard consequences of parametricity\u0000in the presence of primitive nested types. We give several concrete examples\u0000illustrating how our model can be used to derive useful free theorems,\u0000including a short cut fusion transformation, for programs over nested types.\u0000Finally, we consider generalizing our results to GADTs, and argue that no\u0000extension of our parametric model for nested types can give a functorial\u0000interpretation of GADTs in terms of left Kan extensions and still be\u0000parametric.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126872653","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

Quotients, inductive types, and quotient inductive types 商，归纳类型，和商归纳类型

Log. Methods Comput. Sci. Pub Date : 2021-01-08 DOI: 10.46298/lmcs-18(2:15)2022

M. Fiore, A. Pitts, S. Steenkamp

引用次数: 8

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction 保留口吃的部分阶约简的不一致标记问题的详细说明

Log. Methods Comput. Sci. Pub Date : 2020-12-31 DOI: 10.46298/lmcs-17(3:8)2021

Thomas Neele, A. Valmari, T. Willemse

引用次数: 3

Modal meet-implication logic 模态遇见蕴涵逻辑

Log. Methods Comput. Sci. Pub Date : 2020-12-27 DOI: 10.46298/lmcs-18(3:1)2022

Jim de Groot, D. Pattinson

引用次数: 0

Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers 通过可编程分布式调度器实现基于时间流场的协调

Log. Methods Comput. Sci. Pub Date : 2020-12-26 DOI: 10.46298/lmcs-17(4:13)2021

Danilo Pianini, Roberto Casadei, Mirko Viroli, S. Mariani, F. Zambonelli

{"title":"Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers","authors":"Danilo Pianini, Roberto Casadei, Mirko Viroli, S. Mariani, F. Zambonelli","doi":"10.46298/lmcs-17(4:13)2021","DOIUrl":"https://doi.org/10.46298/lmcs-17(4:13)2021","url":null,"abstract":"Emerging application scenarios, such as cyber-physical systems (CPSs), the\u0000Internet of Things (IoT), and edge computing, call for coordination approaches\u0000addressing openness, self-adaptation, heterogeneity, and deployment\u0000agnosticism. Field-based coordination is one such approach, promoting the idea\u0000of programming system coordination declaratively from a global perspective, in\u0000terms of functional manipulation and evolution in \"space and time\" of\u0000distributed data structures called fields. More specifically regarding time, in\u0000field-based coordination (as in many other distributed approaches to\u0000coordination) it is assumed that local activities in each device are regulated\u0000by a fair and unsynchronised fixed clock working at the platform level. In this\u0000work, we challenge this assumption, and propose an alternative approach where\u0000scheduling is programmed in a natural way (along with usual field-based\u0000coordination) in terms of causality fields, each enacting a programmable\u0000distributed notion of a computation \"cause\" (why and when a field computation\u0000has to be locally computed) and how it should change across time and space.\u0000Starting from low-level platform triggers, such causality fields can be\u0000organised into multiple layers, up to high-level, collectively-computed time\u0000abstractions, to be used at the application level. This reinterpretation of\u0000time in terms of articulated causality relations allows us to express what we\u0000call \"time-fluid\" coordination, where scheduling can be finely tuned so as to\u0000select the triggers to react to, generally allowing to adaptively balance\u0000performance (system reactivity) and cost (resource usage) of computations. We\u0000formalise the proposed scheduling framework for field-based coordination in the\u0000context of the field calculus, discuss an implementation in the aggregate\u0000computing framework, and finally evaluate the approach via simulation on\u0000several case studies.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209352","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}

引用次数: 13

Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala 邻域计算:用函数式编程和Scala解决大规模分布和自适应问题

Log. Methods Comput. Sci. Pub Date : 2020-12-15 DOI: 10.46298/lmcs-19(1:6)2023

Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Mirko Viroli

{"title":"Computation Against a Neighbour: Addressing Large-Scale Distribution and Adaptivity with Functional Programming and Scala","authors":"Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Mirko Viroli","doi":"10.46298/lmcs-19(1:6)2023","DOIUrl":"https://doi.org/10.46298/lmcs-19(1:6)2023","url":null,"abstract":"Recent works in contexts like the Internet of Things (IoT) and large-scale\u0000Cyber-Physical Systems (CPS) propose the idea of programming distributed\u0000systems by focussing on their global behaviour across space and time. In this\u0000view, a potentially vast and heterogeneous set of devices is considered as an\u0000\"aggregate\" to be programmed as a whole, while abstracting away the details of\u0000individual behaviour and exchange of messages, which are expressed\u0000declaratively. One such a paradigm, known as aggregate programming, builds on\u0000computational models inspired by field-based coordination. Existing models such\u0000as the field calculus capture interaction with neighbours by a so-called\u0000\"neighbouring field\" (a map from neighbours to values). This requires ad-hoc\u0000mechanisms to smoothly compose with standard values, thus complicating\u0000programming and introducing clutter in aggregate programs, libraries and\u0000domain-specific languages (DSLs). To address this key issue we introduce the\u0000novel notion of \"computation against a neighbour\", whereby the evaluation of\u0000certain subexpressions of the aggregate program are affected by recent\u0000corresponding evaluations in neighbours. We capture this notion in the\u0000neighbours calculus (NC), a new field calculus variant which is shown to\u0000smoothly support declarative specification of interaction with neighbours, and\u0000correspondingly facilitate the embedding of field computations as internal DSLs\u0000in common general-purpose programming languages -- as exemplified by a Scala\u0000implementation, called ScaFi. This paper formalises NC, thoroughly compares it\u0000with respect to the classic field calculus, and shows its expressiveness by\u0000means of a case study in edge computing, developed in ScaFi.","PeriodicalId":314387,"journal":{"name":"Log. Methods Comput. Sci.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124077169","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

Tractable Combinations of Temporal CSPs 时间csp的可处理组合

Log. Methods Comput. Sci. Pub Date : 2020-12-10 DOI: 10.46298/lmcs-18(2:11)2022

M. Bodirsky, Johannes Greiner, Jakub Rydval

引用次数: 1

Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model 酉球中的量子控制:λ - s1及其范畴模型

Log. Methods Comput. Sci. Pub Date : 2020-12-10 DOI: 10.46298/lmcs-18(3:32)2022

Alejandro D'iaz-Caro, Octavio Malherbe

引用次数: 8