物件導向軟體之架構(Object-Oriented Software Construction)探討

A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems -- and of programming languages from a type-theoretic perspective -- has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

https://www.seas.upenn.edu/~bcpierce/tapl/contents.pdf

Types and Programming Languages

Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs. Applications include compilers (for code improvement), software validation (for detecting errors) and transformations between data representation (for solving problems such as Y2K). This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems. The presentation illustrates the extensive similarities between the approaches, helping readers to choose the best one to utilize.

Principles of program analysis

We design a novel, communication-efficient, failure-robust protocol for secure aggregation of high-dimensional data. Our protocol allows a server to compute the sum of large, user-held data vectors from mobile devices in a secure manner (i.e. without learning each user's individual contribution), and can be used, for example, in a federated learning setting, to aggregate user-provided model updates for a deep neural network. We prove the security of our protocol in the honest-but-curious and active adversary settings, and show that security is maintained even if an arbitrarily chosen subset of users drop out at any time. We evaluate the efficiency of our protocol and show, by complexity analysis and a concrete implementation, that its runtime and communication overhead remain low even on large data sets and client pools. For 16-bit input values, our protocol offers $1.73 x communication expansion for 210 users and 220-dimensional vectors, and 1.98 x expansion for 214 users and 224-dimensional vectors over sending data in the clear.

https://dl.acm.org/doi/pdf/10.1145/3133956.3133982

Practical Secure Aggregation for Privacy-Preserving Machine Learning

Domain-specific languages (DSLs) are languages tailored to a specific application domain. They offer substantial gains in expressiveness and ease of use compared with general-purpose programming languages in their domain of application. DSL development is hard, requiring both domain knowledge and language development expertise. Few people have both. Not surprisingly, the decision to develop a DSL is often postponed indefinitely, if considered at all, and most DSLs never get beyond the application library stage.Although many articles have been written on the development of particular DSLs, there is very limited literature on DSL development methodologies and many questions remain regarding when and how to develop a DSL. To aid the DSL developer, we identify patterns in the decision, analysis, design, and implementation phases of DSL development. Our patterns improve and extend earlier work on DSL design patterns. We also discuss domain analysis tools and language development systems that may help to speed up DSL development. Finally, we present a number of open problems.

/pdf/when-and-how-to-develop-domain-specific-languages-29nvxv3ngp.pdf

When and how to develop domain-specific languages

In this note, we report on the first large-scale and practical application of multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.

/pdf/secure-multiparty-computation-goes-live-2yhg53dmgr.pdf

Secure Multiparty Computation Goes Live

This collection contains the positions of most of the 31 participants at the ECOOP'91 W5 Workshop on ''Types, Inheritance and Assignments'' . The workshop was organized in connection with the Fifth Annual European Conference on Object-Oriented Programming, July 15-19 in Geneva, Switzerland. The workshop took place July 16, 9.00-17.30. In addition to the 21 submitted position papers, the collection includes an invited paper by Luca Cardelli. The focus of the workshop is on the premises, results, and aspirations of research in object-oriented type systems.

https://tidsskrift.dk/daimipb/article/download/6587/5710

Types, Inheritance and Assignments: A collection of position papers from the ECOOP '91 workshop W5 (Geneva, Switzerland, 1991, 15-19 July)

We show how to use high-level synchronization constraints, written in a version of monadic second-order logic on finite strings, to synthesize safety controllers for interactive web services. We improve on the naive runtime model to avoid state-space explosions and to increase the flow capacities of services.

/pdf/distributed-safety-controllers-for-web-services-2a3u8wipah.pdf

Distributed Safety Controllers for Web Services

Publisher Summary This chapter presents an account of recursive definitions in a constructive type theory. It discusses these definitions from the viewpoint of category theory. An intimate connection between logic and category theory is well-known. The chapter discusses the relationship between Martin-Lof's intuitionistic type theory (ITT) and categorical logic. To understand the presentation of recursive type definitions, it is first necessary to understand the relationship between ITT and categorical logic. One of the advantages of category theory is that one can give very general definitions of standard constructions. Initially, these definitions might seem a bit contrived because they are expressed entirely in terms of morphisms; however, the resulting definition is more widely applicable than the corresponding definitions given in terms of sets and membership. One can recover many set theoretic ideas in category theory. The resulting theory of set-like categories is called topos theory. Topos theory comes with its own logic and turns out to define an intuitionistic set theory.

Recursively Defined Types in Constructive Type Theory

We present type substitution as a new genericity mechanism for object-oriented languages. It is a subclassing concept on the same footing as inheritance, and is more flexible than parameterized classes. We prove that type substitution and inheritance together form an orthogonal basis for a general subclass relation that captures type-safe code reuse. Thus, genericity and inheritance are independent, complementary components of a unified concept. Our result is obtained in a novel model of classes which encompasses classes as types and assignments.

/pdf/genericity-and-inheritance-1gq6z20mre.pdf

Michael I. Schwartzbach

Papers

Secure Multiparty Computation Goes Live

Types, Inheritance and Assignments: A collection of position papers from the ECOOP '91 workshop W5 (Geneva, Switzerland, 1991, 15-19 July)

Distributed Safety Controllers for Web Services

Recursively Defined Types in Constructive Type Theory

Genericity and inheritance