检索结果-内蒙古大学图书馆

Handling Iterations in Distributed Dataflow Systems

ACM COMPUTING SURVEYS 2022年第9期54卷 1–38页

作者： Gevay, Gabor E. Soto, Juan Markl, Volker Tech Univ Berlin Database Syst & Informat Management DIMA Grp Einsteinufer 17 D-10587 Berlin Germany German Res Ctr Artificial Intelligence DFKI Alt Moabit 91c D-10559 Berlin Germany

Over the past decade, distributed dataflow systems (DDS) have become a standard technology. In these systems, users write programs in restricted dataflow programming models, such as MapReduce, which enable them to scale out program execution to a shared-nothing cluster of machines. Yet, there is no established consensus that prescribes how to extend these programming models to support iterative algorithms. In this survey, we review the research literature and identify how DDS handle control flow, such as iteration, from both the programming model and execution level perspectives. This survey will be of interest for both users and designers of DDS.

关键词： Control flow iteration Distributed dataflows Programming models higher-order functions

来源：评论

学校读者我要写书评

暂无评论

Functional prototypes for generic C++ libraries: a transformational approach based on higher-order, typed signatures

引用

INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER 2015年第1期17卷 91-105页

作者： Lincke, Daniel Schupp, Sibylle Ionescu, Cezar Global Climate Forum Berlin Germany Hamburg Univ Technol Inst Software Syst Hamburg Germany Potsdam Inst Climate Impact Res PIK Res Domain Transdisciplinary Concepts & Methods Potsdam Germany

This paper presents a method for developing generic C++ software libraries from functional prototypes, based on program transformation. More precisely, the type signatures of generic functions, i.e., functions parameterized on types, are transformed. This transformation maps typelevel expressions from functional higher-order, typed languages to type-level expressions in C++. In particular, type-level functional constructs such as higher-order functions and type constructors, are mapped to type parameters of generics that are constrained with appropriate concepts. The core of the transformation is a novel form of "defunctionalization" at the level of types. To make the transformation retargetable, we based it on two kernel languages that can be bound to different functional and object-oriented languages. For this paper, we use bindings to Haskell as front end and C++ with concepts as back end. Our transformational approach presents an alternative to a language extension and is useful particularly for functional prototyping where functional features are employed at specification time. We illustrate our approach by a case study: we show how we developed a generic C++ library for vulnerability modeling in the context of global change from a functional prototype in Haskell.

关键词： Defunctionalization higher-order functions Type constructors Concepts Program transformation

来源：评论

学校读者我要写书评

暂无评论

Optimisation of language-integrated queries by query unnesting

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2017年 47卷 131-150页

作者： Kowalski, Tomasz Marek Adamus, Radoslaw Lodz Univ Technol Inst Appl Comp Sci Ul Stefanowskiego 18-22 PL-90924 Lodz Poland

Native functional-style querying extensions for programming languages (e.g., LINQ or Java 8 streams) are widely considered as declarative. However, their very limited degree of optimisation when dealing with local collection processing contradicts this statement. We show that developers constructing complex LINQ queries or combining queries expose themselves to the risk of severe performance deterioration. For an inexperienced programmer, a way of getting an appropriate query form can be too complicated. Also, a manual query transformation is justified by the need of improving performance, but achieved at the expense of reflecting an actual business goal. As a result, benefits from a declarative form and an increased level of abstraction are lost. In this paper, we claim that moving of selected methods for automated optimisation elaborated for declarative query languages to the level of imperative programming languages is possible and desired. Our approach is based on the assumption that programmer is able distinguish whether a language-integrated query is intentionally used to introduce some side-effects or its sole purpose is to only query the data. We propose two optimisation procedures through query unnesting designed to avoid unnecessary multiple calculations in collection-processing constructs based on higher-order functions. We have implemented and verified this idea as a simple proof-of-concept LINQ optimiser library. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Program optimisation Programming languages Term rewriting Declarative programming higher-order functions LINQ Query decorrelation

来源：评论

学校读者我要写书评

暂无评论

Mesh refinement influence and cardiac-cycle flow periodicity in aorta flow analysis with isogeometric discretization

引用

COMPUTERS & FLUIDS 2019年 179卷 792-800页

作者： Takizawa, Kenji Tezduyar, Tayfun E. Uchikawa, Hiroaki Terahara, Takuya Sasaki, Takafumi Yoshida, Ayaka Waseda Univ Dept Modern Mech Engn Shinjuku Ku 3-4-1 Ookubo Tokyo 1698555 Japan Rice Univ Mech Engn MS 3216100 Main St Houston TX 77005 USA

We present detailed studies on mesh refinement influence and cardiac-cycle flow periodicity in aorta flow analysis with isogeometric discretization. Both factors play a key role in the reliability and practical value of aorta flow analysis. The core computational method is the space-time Variational Multiscale (ST-VMS) method. The other key method is the ST Isogeometric Analysis (ST-IGA). The ST framework, in a general context, provides higher-order accuracy. The VMS feature of the ST-VMS addresses the computational challenges associated with the multiscale nature of the unsteady flow in the aorta. The ST-IGA provides smoother representation of the aorta and increased accuracy in the flow solution. We conduct the studies for a patient-specific aorta geometry. We determine the level of mesh refinement needed and assess the nature of the flow periodicity reached. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Aorta Flow periodicity Mesh refinement Space-Time Variational Multiscale method ST-VMS lsogeometric Analysis IGA higher-order functions

来源：评论

学校读者我要写书评

暂无评论

higher-order Type-Level Programming in Haskell

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2019年第ICFP期3卷 1-26页

作者： Kiss, Csongor Field, Tony Eisenbach, Susan Jones, Simon Peyton Imperial Coll London Dept Comp 180 Queens Gate London SW7 1AZ England Imperial Coll London Comp 180 Queens Gate London SW7 1AZ England Microsoft Res 21 Stn Rd Cambridge CB1 2FB England

Type family applications in Haskell must be fully saturated. This means that all type-level functions have to be first-order, leading to code that is both messy and longwinded. In this paper we detail an extension to GHC that removes this restriction. We augment Haskell's existing type arrow, ->, with an unmatchable arrow, ->, that supports partial application of type families without compromising soundness. A soundness proof is provided. We show how the techniques described can lead to substantial code-size reduction (circa 80%) in the type-level logic of commonly-used type-level libraries whilst simultaneously improving code quality and readability.

关键词： Type-level programming Type families higher-order functions

来源：评论

学校读者我要写书评

暂无评论

THE EFFECT OF OPERATORS ON PARSING AND EVALUATION IN APL

引用

COMPUTER LANGUAGES 1981年第2期6卷 67-78页

作者： GEORGEFF, MP FRIS, I KAUTSKY, J UNIV NEW ENGLAND DEPT COMP SCIARMIDALENSW 2351AUSTRALIA FLINDERS UNIV S AUSTRALIA SCH MATH SCIADELAIDESAAUSTRALIA

The importance of function valued functions (operators) in APL is now well recognized, and considerable attention has been paid to the introduction of more general operators into the language. In this article we consider some of the consequences for the implementation of interpreters and compilers for APL. We first consider the difficulties that arise with the introduction of basic valued and operator valued operators. We then discuss various modifications to the syntactic and semantic structure of APL that serve to avoid these difficulties. Abstraction operators as in the λ calculus are also introduced. Finally, we describe an abstract machine for interpreting APL-like expressions which is analogous to the SECD machine used in the λ calculus.

关键词： APL Programming languages higher-order functions Operators Parsing Interpretation Compilation Evaluation

来源：评论

学校读者我要写书评

暂无评论

Functional Programming for Modular Bayesian Inference

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2018年第ICFP期2卷 1–29页

作者： Scibior, Adam Kammar, Ohad Ghahramani, Zoubin Univ Cambridge Dept Engn Trumpington St Cambridge CB2 1PZ England MPI Intelligent Syst Empir Inference Dept Spemannstr 34 D-72076 Tubingen Germany Univ Oxford Dept Comp Sci Wolfson BldgParks Rd Oxford OX1 3QD England Uber AI Labs San Francisco CA USA

We present an architectural design of a library for Bayesian modelling and inference in modern functional programming languages. The novel aspect of our approach are modular implementations of existing state-of-the-art inference algorithms. Our design relies on three inherently functional features: higher-order functions, inductive data-types, and support for either type-classes or an expressive module system. We provide a performant Haskell implementation of this architecture, demonstrating that high-level and modular probabilistic programming can be added as a library in sufficiently expressive languages. We review the core abstractions in this architecture: inference representations, inference transformations, and inference representation transformers. We then implement concrete instances of these abstractions, counterparts to particle filters and Metropolis-Hastings samplers, which form the basic building blocks of our library. By composing these building blocks we obtain state-of-the-art inference algorithms: Resample-Move Sequential Monte Carlo, Particle Marginal Metropolis-Hastings, and Sequential Monte Carlo Squared. We evaluate our implementation against existing probabilistic programming systems and find it is already competitively performant, although we conjecture that existing functional programming optimisation techniques could reduce the overhead associated with the abstractions we use. We show that our modular design enables deterministic testing of inherently stochastic Monte Carlo algorithms. Finally, we demonstrate using OCand that an expressive module system can also implement our design.

关键词： probabilistic programming functional programming Bayesian inference higher-order functions inductive types type-classes module systems monads monad transformers machine learning Anglican WebPPL Markov Chain Monte Carlo Sequential Monte Carlo Monte Carlo samplers

来源：评论

学校读者我要写书评

暂无评论

APL Since 1978

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2020年第HOPL期4卷 1–108页

作者： Hui, Roger K. W. Kromberg, Morten J. Dyalog Ltd Toronto ON Canada Dyalog Ltd Bramley RG26 5BH Hants England

The Evolution of APL, the HOPL I paper by Falkoff and Iverson on APL, recounted the fundamental design principles which shaped the implementation of the APL language in 1966, and the early uses and other influences which shaped its first decade of *** the 40 years that have elapsed since HOPL I, several dozen APL implementations have come and gone. In the first decade or two, interpreters were typically born and buried along with the hardware or operating system that they were created for. More recently, the use of C as an implementation language provided APL interpreters with greater longevity and *** started its life on IBM mainframes which were time-shared by multiple users. As the demand for computing resources grew and costs dropped, APL first moved in-house to mainframes, then to mini- and micro-computers. Today, APL runs on PCs and tablets, Apples and Raspberry Pis, smartphones and *** operating systems, and the software application platforms that APL runs on, have evolved beyond recognition. Tools like database systems have taken over many of the tasks that were initially implemented in APL or provided by the APL system, and new capabilities like parallel hardware have also changed the focus of design and implementation efforts through the *** first wave of significant language enhancements occurred shortly after HOPL I, resulting in so-called second-generation APL systems. The most important feature of the second generation is the addition of general arrays—in which any item of an array can be another array—and a number of new functions and operators aligned with, if not always motivated by, the new data *** majority of implementations followed IBM’s path with APL2 “floating” arrays; others aligned themselves with SHARP APL and “grounded” arrays. While the APL2 style of APL interpreters came to dominate the mainstream of the APL community, two new cousins of APL descended from the SHARP APL family tree: J (cr

关键词： APL array programming executable mathematical notation functional programming higher-order functions programming languages

来源：评论

学校读者我要写书评

暂无评论

Modular Specification and Verification of Closures in Rust

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2021年第OOPSLA期5卷 1–29页

作者： Wolff, Fabian Bily, Aurel Matheja, Christoph Mueller, Peter Summers, Alexander J. Swiss Fed Inst Technol Dept Comp Sci Zurich Switzerland Univ British Columbia Dept Comp Sci Vancouver BC Canada

Closures are a language feature supported by many mainstream languages, combining the ability to package up references to code blocks with the possibility of capturing state from the environment of the closure's declaration. Closures are powerful, but complicate understanding and formal reasoning, especially when closure invocations may mutate objects reachable from the captured state or from closure arguments. This paper presents a novel technique for the modular specification and verification of closure-manipulating code in Rust. Our technique combines Rust's type system guarantees and novel specification features to enable formal verification of rich functional properties. It encodes higher-order concerns into a first-order logic, which enables automation via SMT solvers. Our technique is implemented as an extension of the deductive verifier Prusti, with which we have successfully verified many common idioms of closure usage.

关键词： Rust closures higher-order functions software verification

来源：评论

学校读者我要写书评

暂无评论

Provably Correct, Asymptotically Efficient, higher-order Reverse-Mode Automatic Differentiation

引用

PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL 2022年第POPL期6卷 1–30页

作者： Krawiec, Faustyna Jones, Simon Peyton Krishnaswami, Neel Ellis, Tom Eisenberg, Richard A. Fitzgibbon, Andrew Univ Cambridge Dept Comp Sci & Technol Cambridge England Microsoft Res Cambridge England Tweag Paris France

In this paper, we give a simple and efficient implementation of reverse-mode automatic differentiation, which both extends easily to higher-order functions, and has run time and memory consumption linear in the run time of the original program. In addition to a formal description of the translation, we also describe an implementation of this algorithm, and prove its correctness by means of a logical relations argument.

关键词： Reverse-Mode AD Wengert List higher-order functions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：