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

Learning TypeScript 2.x: Develop and maintain captivating web applications with ease 2

2018年

作者： Remo H. Jansen

ISBN: (数字)9781788396608

ISBN: (纸本)9781788391474

Exploit the features of TypeScript to easily create your very own web applications About This Book • Develop modular, scalable, maintainable, and adaptable web applications by taking advantage of TypeScript • Walk through the fundamentals of TypeScript with the help of practical examples • Enhance your web development skills using TypeScript 2.x Who This Book Is For If you are a developer aiming to learn TypeScript to build attractive web applications, this book is for you. No prior knowledge of TypeScript is required. However, a basic understanding of JavaScript would be an added advantage. What You Will Learn • Understand TypeScript in depth, including its runtime and advanced type system features • Master the core principles of the object-oriented programming and functional programming paradigms with TypeScript • Save time using automation tools such as Gulp, Webpack, ts-node, and npm scripts • Develop robust, modular, scalable, maintainable, and adaptable applications with testing frameworks such as Mocha, Chai, and *** • Put your TypeScript skills to practice by developing full-stack web applications with ***, React and Angular • Use the APIs of the TypeScript compiler to build custom code analysis tool In Detail TypeScript is an open source and cross-platform statically typed superset of JavaScript that compiles to plain JavaScript and runs in any browser or host. This book is a step-by-step guide that will take you through the use and benefits of TypeScript with the help of practical examples. You will start off by understanding the basics as well as the new features of TypeScript 2.x. Then, you will learn how to work with functions and asynchronous programming APIs. You will continue by learning how to resolve runtime issues and how to implement TypeScript applications using the Object-oriented programming (OOP) and functional programming (FP) paradigms. Later, you will automate your development workflow with the help of tools such as Webpac

关键词： TypeScript JavaScript Angular Grunt Karma Object Oriented programming Functional programming asynchronous programming

来源：评论

学校读者我要写书评

暂无评论

Guaranteeing responsiveness and consistency in dynamic, asynchronous graphical user interfaces

Guaranteeing responsiveness and consistency in dynamic, asyn...

引用

作者： Foust, Charles Gabriel Texas A&M University

学位级别：Ph.D.

This dissertation proposes a programming model for Graphical User Interfaces (GUIs) that relieves the programmer of a difficult and error-prone task: orchestrating concurrent responses to events to ensure data dependencies are always enforced correctly. In this programming model, rather than defining program responses to events, the programmer defines the data dependencies that exist in the GUI and the methods by which those dependencies may be enforced—a run-time system uses this specification to generate responses to events. The approach gives the following guarantee: the same sequence of events produces the same results, regardless of the timing of those events. The dissertation demonstrates the benefits of the proposed programming model with implementations of several example user interfaces. At the core of this programming model is a data structure known as a property model. A property model composes responses to individual events into a single reactive program that runs asynchronously. The program's results are used to update the GUI. The program is constructed in a manner that respects all data dependencies, thereby guaranteeing that results are consistent regardless of the length of time taken by individual responses. The core reactive program may be extended with features that support additional functionality, such as access to prior variable values, optional data dependencies, and identifying unused variables. The dissertation defines the semantics of the construction and execution of this reactive program formally. The dissertation shows how property models may be defined as a composition of reusable components. This is essential for modeling GUIs whose structures change in response to user events by the addition or removal of components. Components can contain data and dependencies as well as templates that describe how dependencies arise from composition with other components. Furthermore, templates can be written for arrays of components to define depe

关键词： graphical user interfaces asynchronous programming reactive programming dataflow constraint systems Thesis

来源：评论

学校读者我要写书评

暂无评论

Reactive Async: Expressive Deterministic Concurrency 7

Reactive Async: Expressive Deterministic Concurrency

引用

7th ACM SIGPLAN Symposium on Scala

作者： Haller, Philipp Geries, Simon Eichberg, Michael Salvaneschi, Guido KTH Royal Inst Technol Stockholm Sweden Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781450346481

Concurrent programming is infamous for its difficulty. An important source of difficulty is non-determinism, stemming from unpredictable interleavings of concurrent activities. Futures and promises are widely-used abstractions that help designing deterministic concurrent programs, although this property cannot be guaranteed statically in mainstream programming languages. Deterministic-by-construction concurrent programming models avoid this issue, but they typically restrict expressiveness in important ways. This paper introduces a concurrent programming model, Reactive Async, which decouples concurrent computations using so-called cells, shared locations which generalize futures as well as recent deterministic abstractions such as LVars. Compared to previously proposed programming models Reactive Async provides (a) a fallback mechanism for the case where no computation ever computes the value of a given cell, and (b) explicit and optimized handling of cyclic dependencies. We present a complete implementation of the Reactive Async programming model as a library in Scala. Finally, the paper reports on a case study applying Reactive Async to static analyses of JVM bytecode based on the Opal framework.

关键词： asynchronous programming concurrent programming deterministic concurrency static analysis Scala

来源：评论

学校读者我要写书评

暂无评论

Typing Composable Coroutines 12

Typing Composable Coroutines

引用

12th International Conference on Computer Technologies and Development (TechDev)

作者： Gu, Qiqi Ke, Wei Macao Polytechn Univ Fac Sci Appl Macau Peoples R China

ISBN: (纸本)9798350381269;9798350381276

Coroutine, as a powerful programming construct, is widely used in asynchronous applications to replace thread-based programming or the callback hell. Using coroutines makes code more readable and maintainable, for its ability to transfer control while keeping the literal scope. However, reasoning about coroutine behavior can be challenging without proper typing. We propose a type notation and calculus for composing asymmetric, first-class, stackless coroutines. Given the types of a list of coroutines, we can compute a composed type matching the collective behavior of the coroutines, so that the input and output can be type-checked by a type system. Our coroutine types can model the data received by or yielded from a coroutine, which be of coroutine types as well. On top of our type calculus, we discuss its soundness and evaluation issues, then provide four application scenarios of our coroutine types. Not only can our types be used in modern programming languages, such as Python, but also model program behaviors in OCaml and even Prolog.

关键词： Coroutines asynchronous programming Dependent types Type Theory

来源：评论

学校读者我要写书评

暂无评论

Towards An Event-Driven programming Model for OpenMP 45

Towards An Event-Driven Programming Model for OpenMP

引用

45th International Conference on Parallel Processing (ICPP)

作者： Fan, Xing Sinnen, Oliver Giacaman, Nasser Univ Auckland Dept Elect & Comp Engn Auckland 1 New Zealand

ISBN: (纸本)9781509028252

The event-driven programming pattern is pervasive in a wide range of modern software applications. Unfortunately, it is not easy to achieve good performance and responsiveness when developing event-driven applications. Traditional approaches require a great amount of programmer effort to restructure and refactor code, to achieve the performance speedup from parallelism and asynchronization. Not only does this restructuring require a lot of development time, it also makes the code harder to debug and understand. We propose an asynchronous programming model based on the philosophy of OpenMP, which does not require code restructuring of the original sequential code. This asynchronous programming model is complementary to the existing OpenMP fork-join model. The coexistence of the two models has potential to decrease developing time for parallel event-driven programs, since it avoids major code refactoring. In addition to its programming simplicity, evaluations show that this approach achieves good performance improvements consistent with more traditional event-driven parallelization.

关键词： OpenMP parallel programming model event-driven programming asynchronous programming

来源：评论

学校读者我要写书评

暂无评论

On the Verification of Concurrent, asynchronous Programs with Waiting Queues

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2015年第3期14卷 58-58页

作者： Geeraerts, Gilles Heussner, Alexander Raskin, Jean-Francois Univ Libre Bruxelles Dept Informat CPI 212Blvd Triomphe B-1050 Brussels Belgium Otto Friedrich Univ Bamberg Lehrstuhl Softwaretechn & Programmiersprachen D-96045 Bamberg Germany

Recently, new libraries, such as Grand Central Dispatch (GCD), have been proposed to directly harness the power of multicore platforms and to make the development of concurrent software more accessible to software engineers. When using such a library, the programmer writes so-called blocks, which are chunks of code, and dispatches them using synchronous or asynchronous calls to several types of waiting queues. A scheduler is then responsible for dispatching those blocks among the available cores. Blocks can synchronize via a global memory. In this article, we propose Queue-Dispatch asynchronous Systems as a mathematical model that faithfully formalizes the synchronization mechanisms and behavior of the scheduler in those systems. We study in detail their relationships to classical formalisms such as pushdown systems, Petri nets, FIFO systems, and counter systems. Our main technical contributions are precise worst-case complexity results for the Parikh coverability problem and the termination problem for several subclasses of our model. We also consider an extension of QDAS with a fork-join mechanism. Adding fork-join to any of the subclasses that we have identified leads to undecidability of the coverability problem. This motivates the study of over-approximations. Finally, we consider handmade abstractions as a practical way of verifying programs that cannot be faithfully modeled by decidable subclasses of QDAS.

关键词： Algorithms Theory Verification asynchronous programming waiting queues

来源：评论

学校读者我要写书评

暂无评论

Generating Reactive Programs for Graphical User Interfaces from Multi-way Dataflow Constraint Systems

引用

ACM SIGPLAN NOTICES 2016年第3期51卷 121-130页

作者： Foust, Gabriel Jarvi, Jaakko Parent, Sean Texas A&M Univ College Stn TX 77843 USA Adobe Syst Inc Maidenhead Berks England

For a GUI to remain responsive, it must be able to schedule lengthy tasks to be executed asynchronously. In the traditional approach to GUI implementation writing functions to handle individual user events asynchronous programming easily leads to defects. Ensuring that all data dependencies are respected is difficult when new events arrive while prior events are still being handled. Reactive programming techniques, gaining popularity in GUI programming, help since they make data dependencies explicit and enforce them automatically as variables' values change. However, data dependencies in GUIs usually change along with its state. Reactive programming must therefore describe a GUI as a collection of many reactive programs, whose interaction the programmer must explicitly coordinate. This paper presents a declarative approach for GUI programming that relieves the programmer from coordinating asynchronous computations. The approach is based on our prior work on "property models", where GUI state is maintained by a dataflow constraint system. A property model responds to user events by atomically constructing new data dependencies and scheduling asynchronous computations to enforce those dependencies. In essence, a property model dynamically generates a reactive program, adding to it as new events occur. The approach gives the following guarantee: the same sequence of events produces the same results, regardless of the timing of those events.

关键词： Design Theory Dataflow constraint systems Graphical user interfaces asynchronous programming

来源：评论

学校读者我要写书评

暂无评论

Migrating from Developing asynchronous Multi-Threading Programs to Reactive Programs in Java

引用

APPLIED SCIENCES-BASEL 2024年第24期14卷 12062页

作者： Zbarcea, Andrei Tudose, Catalin Natl Univ Sci & Technol Politehn Bucharest Fac Automatic Control & Comp Bucharest 060042 Romania Luxoft Romania Bucharest 060042 Romania

Modern software application development imposes standards regarding high performance, scalability, and minimal system latency. Multi-threading asynchronous programming is one of the standard solutions proposed by the industry for achieving such objectives. However, the recent introduction of the reactive programming interface in Java presents a potential alternative approach for addressing such challenges, promising performance improvements while minimizing resource utilization. The research examines the migration process from the asynchronous paradigm to the reactive paradigm, highlighting the implications, benefits, and challenges resulting from this transition. To this end, the architecture, technologies, and design of a support application are presented, outlining the practical aspects of this experimental process while closely monitoring the phased migration. The results are examined in terms of functional equivalence, testing, and comparative analysis of response times, resource utilization, and throughput, as well as the cases where the reactive paradigm proves to be a solution worth considering. Across multiple scenarios, the reactive paradigm demonstrated advantages such as up to 12% reduction in memory usage, 56% faster 90th percentile response times, and a 33% increase in throughput under high-concurrency conditions. However, the results also reveal cases, such as data-intensive scenarios, where asynchronous programming outperforms reactive approaches. Additionally, possible directions for further research and development are presented. This paper not only investigates the design and implementation process but also sets a foundation for future research and innovation in dependable systems, collaborative technologies, sustainable solutions, and distributed system architecture.

关键词： Java asynchronous programming multi-threading reactive programming migration from asynchronous to reactive

来源：评论

学校读者我要写书评

暂无评论

Stream my models: reactive peer-to-peer distributed [email protected] 15

Stream my models: reactive peer-to-peer distributed [email p...

引用

Proceedings of the 18th International Conference on Model Driven Engineering Languages and Systems

作者： Thomas Hartmann Assaad Moawad Francois Fouquet Gregory Nain Jacques Klein Yves Le Traon University of Luxembourg Luxembourg

ISBN: (纸本)9781467369084

The [email protected] paradigm promotes the use of models during the execution of cyber-physical systems to represent their context and to reason about their runtime behaviour. However, current modeling techniques do not allow to cope at the same time with the large-scale, distributed, and constantly changing nature of these systems. In this paper, we introduce a distributed [email protected] approach, combining ideas from reactive programming, peer-to-peer distribution, and large-scale [email protected] We define distributed models as observable streams of chunks that are exchanged between nodes in a peer-to-peer manner. A lazy loading strategy allows to transparently access the complete virtual model from every node, although chunks are actually distributed across nodes. Observers and automatic reloading of chunks enable a reactive programming style. We integrated our approach into the Kevoree Modeling Framework and demonstrate that it enables frequently changing, reactive distributed models that can scale to millions of elements and several thousand nodes.

关键词： asynchronous programming distributed models peer-to-peer reactive programming

来源：评论

学校读者我要写书评

暂无评论

Automated refactoring to reactive programming 19

Automated refactoring to reactive programming

引用

Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering

作者： Mirko Köhler Guido Salvaneschi Technische Universität Darmstadt Darmstadt Germany

ISBN: (纸本)9781728125084

Reactive programming languages and libraries, such as ReactiveX, have been shown to significantly improve software design and have seen important industrial adoption over the last years. asynchronous applications - which are notoriously error-prone to implement and to maintain - greatly benefit from reactive programming because they can be defined in a declarative style, which improves code clarity and *** this paper, we tackle the problem of refactoring existing software that has been designed with traditional abstractions for asynchronous programming. We propose 2Rx, a refactoring approach to automatically convert asynchronous code to reactive programming. Our evaluation on top-starred GitHub projects shows that 2Rx is effective with common asynchronous constructs and it can provide a refactoring for 91.7% of their occurrences.

关键词： refactoring reactive programming asynchronous programming Java

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：