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

1st acm sigplan International Workshop on Type-Driven Development, TyDe 2016, co-located with the International conference on Functional programming, ICFP 2016

作者： Gibbons, Jeremy University of Oxford United Kingdom

ISBN: (纸本)9781450344357

A lot of the expressive power of array-oriented languages such as Iverson's APL and J comes from their implicit lifting of scalar operations to act on higher-ranked data, for example to add a value to each element of a vector, or to add two compatible matrices pointwise. But it is a shape error to attempt to combine arguments of incompatible shape, such as a 3-vector with a 4-vector. APL and J are dynamically typed, so such shape errors are caught only at run-time. Recent work by Slepak et al. develops a custom static type system for an array-oriented language. We show here that such a custom language design is unnecessary; the requisite compatibility checks can already be captured in modern expressive type systems, as found for example in Haskell, and moreover, generative type-driven programming can use that static type information constructively to automatically induce the appropriate liftings. We show also that the structure of multi-dimensional data is inherently a matter of Naperian applicative functors - lax monoidal functors, with strength, commutative up to isomorphism under composition.

关键词： APL Applicative functor Array Rank polymorphism

来源：评论

学校读者我要写书评

暂无评论

From Datalog to FLIX: A Declarative language for Fixed Points on Lattices

引用

acm sigplan NOTICES 2016年第6期51卷 194-208页

作者： Madsen, Magnus Yee, Ming-Ho Lhotak, Ondrej Univ Waterloo Waterloo ON N2L 3G1 Canada

We present FLIX, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. FLIX is inspired by Datalog and extends it with lattices and monotone functions. Using FLIX, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax. We define a model-theoretic semantics of FLIX as a natural extension of the Datalog semantics. This semantics captures the declarative meaning of FLIX programs without imposing any specific evaluation strategy. An efficient strategy is semi-naive evaluation which we adapt for FLIX. We have implemented a compiler and runtime for FLIX, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. The declarative nature of FLIX clearly exposes the similarity between these two algorithms.

关键词： logic programming static analysis Datalog Logic programming Static Analysis

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of remote memory access programming 2016

Modeling and analysis of remote memory access programming

引用

2016 acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA 2016

作者： Dan, Andrei Marian Lam, Patrick Hoefler, Torsten Vechev, Martin ETH Zurich Switzerland University of Waterloo Canada

ISBN: (纸本)9781450344449

Recent advances in networking hardware have led to a new generation of Remote Memory Access (RMA) networks in which processors from different machines can communicate directly, bypassing the operating system and allowing higher performance. Researchers and practitioners have proposed libraries and programming models for RMA to enable the development of applications running on these networks, However, the memory models implied by these RMA libraries and languages are often loosely specified, poorly understood, and differ depending on the underlying network architecture and other factors. Hence, it is difficult to precisely reason about the semantics of RMA programs or how changes in the network architecture affect them. We address this problem with the following contributions: (i) a coreRMA language which serves as a common foundation, formalizing the essential characteristics of RMA programming;(ii) complete axiomatic semantics for that language;(iii) integration of our semantics with an existing constraint solver, enabling us to exhaustively generate core- RMA programs (litmus tests) up to a specified bound and check whether the tests satisfy their specification;and (iv) extensive validation of our semantics on real-world RMA systems. We generated and ran 7,441 litmus tests using each of the low-level RMA network APIs: DMAPP, VPI Verbs, and Portals 4. Our results confirmed that our model successfully captures behaviors exhibited by these networks. Moreover, we found RMA programs that behave inconsistently with existing documentation, confirmed by network experts. Our work provides an important step towards understanding existing RMA networks, thus influencing the design of future RMA interfaces and hardware. © 2016 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Scalable Kernel TCP design and implementation for Short-Lived Connections 16

Scalable Kernel TCP Design and Implementation for Short-Live...

引用

21st International conference on Architectural Support for programming languages and Operating Systems

作者： Lin, Xiaofeng Chen, Yu Li, Xiaodong Mao, Junjie He, Jiaquan Xu, Wei Shi, Yuanchun Sina Corp ZHIHU Corp Beijing Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Sina Corp Beijing Peoples R China

ISBN: (纸本)9781450340915

With the rapid growth of network bandwidth, increases in CPU cores on a single machine, and application API models demanding more short-lived connections, a scalable TCP stack is performance-critical. Although many clean-state designs have been proposed, production environments still call for a bottom-up parallel TCP stack design that is backward-compatible with existing applications. We present Fastsocket, a BSD Socket-compatible and scalable kernel socket design, which achieves table-level connection partition in TCP stack and guarantees connection locality for both passive and active connections. Fastsocket architecture is a ground up partition design, from NIC interrupts all the way up to applications, which naturally eliminates various lock contentions in the entire stack. Moreover, Fastsocket maintains the full functionality of the kernel TCP stack and BSD-socket-compatible API, and thus applications need no modifications. Our evaluations show that Fastsocket achieves a speedup of 20.4x on a 24-core machine under a workload of short-lived connections, outperforming the state-of-the-art Linux kernel TCP implementations. When scaling up to 24 CPU cores, Fastsocket increases the throughput of Nginx and HAProxy by 267% and 621% respectively compared with the base Linux kernel. We also demonstrate that Fastsocket can achieve scalability and preserve BSD socket API at the same time. Fastsocket is already deployed in the production environment of Sina WeiBo, serving 50 million daily active users and billions of requests per day.

关键词： TCP/IP multicore system operating system

来源：评论

学校读者我要写书评

暂无评论

design and Evaluation of a Rapid programming System for Service Robots 11

Design and Evaluation of a Rapid Programming System for Serv...

引用

11th acm/IEEE International conference on Human-Robot Interaction (HRI)

作者： Huang, Justin Lau, Tessa Cakmak, Maya Univ Washington Comp Sci & Engn Seattle WA 98195 USA Savioke Inc Santa Clara CA USA

ISBN: (纸本)9781467383691

This paper introduces CustomPrograms, a rapid programming system for mobile service robots. With Custom-Programs, roboticists can quickly create new behaviors and try unexplored use cases for commercialization. In our system, the robot has a set of primitive capabilities, such as navigating to a location or interacting with users on a touch screen. Users can then compose these primitives with general-purpose programming language constructs like variables, loops, conditionals, and functions. The programming language is wrapped in a graphical interface. This allows inexperienced or novice programmers to benefit from the system as well. We describe the design and implementation of CustomPrograms on a Savioke Relay robot in detail. Based on interviews conducted with Savioke roboticists, designers, and business people, we learned of several potential new use cases for the robot. We characterize our system's ability to fulfill these use cases. Additionally, we conducted a user study of the interface with Savioke employees and outside programmers. We found that experienced programmers could learn to use the interface and create 3 real-world programs during the 90 minute study. Inexperienced programmers were less likely to create complex programs correctly. We provide an analysis of the errors made during the study, and highlight the most common pieces of feedback we received. Two case studies show how the system was used internally at Savioke and at a major trade show.

关键词： Touch screens

来源：评论

学校读者我要写书评

暂无评论

Dependent partitioning 2016

Dependent partitioning

引用

2016 acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA 2016

作者： Treichler, Sean Bauer, Michael Sharma, Rahul Slaughter, Elliott Aiken, Alex Stanford University United States NVIDIA Research United States

ISBN: (纸本)9781450344449

A key problem in parallel programming is how data is parti- tioned: divided into subsets that can be operated on in parallel and, in distributed memory machines, spread across multiple address spaces. We present a dependent partitioning framework that allows an application to concisely describe relationships between partitions. Applications first establish independent partitions, which may contain arbitrary subsets of application data, permitting the expression of arbitrary applicationspecific data distributions. Dependent partitions are then derived from these using the dependent partitioning oper- ations provided by the framework. By directly capturing inter-partition relationships, our framework can soundly and precisely reason about programs to perform important program analyses crucial to ensuring correctness and achieving good performance. As an example of the reasoning made possible, we present a static analysis that discharges most consistency checks on partitioned data during compilation. We describe an implementation of our framework within Regent, a language designed for the Legion programming model. The use of dependent partitioning constructs results in a 86-96% decrease in the lines of code required to describe the partitioning, eliminates many of the expensive dynamic checks required for soundness by the current Regent partitioning implementation, and speeds up the computation of partitions by 2.6-12.7X even on a single thread. Additionally, we show that a distributed implementation incorporated into the the Legion runtime system allows partitioning of data sets that are too large to fit on a single node and yields a further 29X speedup of partitioning operations on 64 nodes. © 2016 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

OrcO: A Concurrency-First Approach to Objects

引用

acm sigplan NOTICES 2016年第10期51卷 548-567页

作者： Peters, Arthur Michener Kitchin, David Thywissen, John A. Cook, William R. Univ Texas Austin Austin TX 78712 USA Google Inc Mountain View CA USA

The majority of modern programming languages provide concurrency and object-orientation in some form. However, object-oriented concurrency remains cumbersome in many situations. We introduce the language OrcO, Orc with concurrent Objects, which enables a flexible style of concurrent object-oriented programming. OrcO extends the Orc programming language by adding abstractions for programming-in-the-large;namely objects, classes, and inheritance. OrcO objects are designed to be orthogonal to concurrency, allowing the concurrent structure and object structure of a program to evolve independently. This paper describes OrcO's goals and design and provides examples of how OrcO can be used to deftly handle events, object management, and object composition.

关键词： Composition futures language design mixin inheritance object supervision Orc

来源：评论

学校读者我要写书评

暂无评论

acm International conference Proceeding Series

ACM International Conference Proceeding Series

引用

28th Symposium on the implementation and Application of Functional programming languages, IFL 2016

ISBN: (纸本)9781450347679

The proceedings contain 11 papers. The topics discussed include: signal rate inference for multidimensional Faust;type directives and type graphs in elm;towards the layout of things;a portable VM-based implementation platform for non-strict functional programming languages;contractive functions on infinite data structures;design and implementation of probabilistic programming language Anglican;a lazy language needs a lazy type system: introducing polymorphic contexts;Eliom: tierless web programming from the ground up;synthesis of railway-signaling plans using reachability games;a lightweight hat: simple type-preserving instrumentation for self-tracing lazy functional programs;and identifying and introducing interfaces and callbacks using wrangler.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Temporal NetKAT

引用

acm sigplan NOTICES 2016年第6期51卷 386-401页

作者： Beckett, Ryan Greenberg, Michael Walker, David Princeton Univ Princeton NJ 08544 USA Pomona Coll Claremont CA 91711 USA

Over the past 5-10 years, the rise of software-defined networking (SDN) has inspired a wide range of new systems, libraries, hypervisors and languages for programming, monitoring, and debugging network behavior. Oftentimes, these systems are disjoint-one language for programming and another for verification, and yet another for run-time monitoring and debugging. In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. As its name suggests, Temporal NetKAT is the synthesis of two formal theories: past-time (finite trace) linear temporal logic and (network) Kleene Algebra with Tests. Temporal predicates allow programmers to write down concise properties of a packet's path through the network and to make dynamic packet-forwarding, access control or debugging decisions on that basis. In addition to being useful for programming, the combined equational theory of LTL and NetKAT facilitates proofs of pathbased correctness properties. Using new, general, proof techniques, we show that the equational semantics is sound with respect to the denotational semantics, and, for a class of programs we call network-wide programs, complete. We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations.

关键词： Software-defined networking Network programming languages Domain-specific languages Kleene algebra with tests NetKAT Temporal logic

来源：评论

学校读者我要写书评

暂无评论

A Glimpse of Hopjs

引用

acm sigplan NOTICES 2016年第9期51卷 180-192页

作者： Serrano, Manuel Prunet, Vincent Inria Sophia Mediterranee 2004 Route Lucioles F-06902 Sophia Antipolis France

Hop. js is a multitier programming environment for JavaScript. It allows a single JavaScript program to describe the client-side and the server-side components of a web application. Its runtime environment ensures consistent executions of the application on the server and on the client. This paper overviews the Hop. js design. It shows the JavaScript extensions that makes it possible to conceive web applications globally. It presents how Hop. js interacts with the outside world. It also briefly presents the Hop. js implementation. It presents the Hop. js web server implementation, the handling of server-side parallelism, and the JavaScript and HTML compilers.

关键词： Web programming Functional programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：