FeatherTrait

Session types allow communication protocols to be specified type-theoretically so that protocol implementations can be verified by static type-checking. We extend previous work on session types for distributed object-oriented languages in three ways. (1) We attach a session type to a class definition, to specify the possible sequences of method calls. (2) We allow a session type (protocol) implementation to be modularized , i.e. partitioned into separately-callable methods. (3) We treat session-typed communication channels as objects, integrating their session types with the session types of classes. The result is an elegant unification of communication channels and their session types, distributed object-oriented programming, and a form of typestates supporting non-uniform objects, i.e. objects that dynamically change the set of available methods. We define syntax, operational semantics, a sound type system, and a correct and complete type checking algorithm for a small distributed class-based object-oriented language. Static typing guarantees that both sequences of messages on channels, and sequences of method calls on objects, conform to type-theoretic specifications, thus ensuring type-safety. The language includes expected features of session types, such as delegation, and expected features of object-oriented programming, such as encapsulation of local state. We also describe a prototype implementation as an extension of Java.

Class inheritance and method overriding, as provided by standard class-based languages, are not flexible enough to represent the dynamic behavior of objects; with this respect, object composition and delegation are often advocated as a more flexible alternative to class inheritance since they act at run-time, thus permitting the behavior of objects to be specialized dynamically. In this paper we present Incomplete Featherweight Java (IFJ), an extension of Featherweight Java with incomplete objects, i.e., objects that require some missing methods which can be provided at run-time by composition with another (complete) object. The mechanism for method invocation is based on delegation and it is disciplined by static typing, therefore the language enjoys type safety (which implies no message-not-understood run-time errors) and avoids possible accidental overrides due to method clashes.

We present FJ&$\lambda$, a new core calculus that extends Featherweight Java (FJ) with interfaces, supporting multiple inheritance in a restricted form, $\lambda$-expressions, and intersection types. Our main goal is to formalise how lambdas and intersection types are grafted on Java 8, by studying their properties in a formal setting. We show how intersection types play a significant role in several cases, in particular in the typecast of a $\lambda$-expression and in the typing of conditional expressions. We also embody interface \emph{default methods} in FJ&$\lambda$, since they increase the dynamism of $\lambda$-expressions, by allowing these methods to be called on $\lambda$-expressions. The crucial point in Java 8 and in our calculus is that $\lambda$-expressions can have various types according to the context requirements (target types): indeed, Java code does not compile when $\lambda$-expressions come without target types. In particular, in the operational semantics we must record target types by decorating $\lambda$-expressions, otherwise they would be lost in the runtime expressions. We prove the subject reduction property and progress for the resulting calculus, and we give a type inference algorithm that returns the type of a given program if it is well typed. The design of FJ&$\lambda$ has been driven by the aim of making it a subset of Java 8, while preserving the elegance and compactness of FJ. Indeed, FJ&$\lambda$ programs are typed and behave the same as Java programs.

Context-awareness has become increasingly important for mobile and ubiquitous computing. However, current mainstream object-oriented languages provide little explicit support for context-awareness. Object composition and delegation are often advocated as a flexible approach to represent dynamic behavior of objects with some dynamic behavior. In this paper, we propose Dynamic Behavior Adaptation Featherweight Java (DBAFJ), an extension of Featherweight Java with object composition and delegation, to support for context-awareness. In DBAFJ, each layer consists of a set of layered classes and a predicate method. The former defines a set of context-specific methods, and the latter describes a specific context. Instances of layered classes are created by the runtime system and are specialized in object composition that is context-based. Objects can be adapted by object composition at runtime to obtain new context-specific methods, and delegation with a static type discipline ensures that these new methods are correctly executed. Therefore, DBAFJ supports that the program dynamically adjust its behavior to the current execution context. The sound type system of DBAFJ assures that no message-not-understood errors occur at run-time.

Despite the rising popularity and usefulness of events, or implicit invocation, in software design, the availability of general-purpose event mechanisms are rare. Further, most event mechanisms available for software design are implemented as libraries or sets of macros that are constrained by the language in which they are used; making such mechanisms inconvenient to use as well as error-prone. Event mechanisms that are a part of a programming language can do away with such constraints; thus making events easier to use. However, there are few languages that offer built-in events and even fewer languages have a built-in general-purpose event mechanism. In order to promote the study of implicit invocation in programming languages, this thesis presents a formal programming language foundation for events. This thesis expands the, object-based, impς-calculus to create a calculus for objects and events, the %$ςcalculus. The %$ς-calculus has a formal syntax, semantics, and a sound type system that is useful for defining practical programming languages that include built-in events. This, along with the ability of the calculus to easily simulate many different event mechanisms make it a good start toward a formal understanding of implicit invocation.

: We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavior as a standard implementation using v-tables and self-application for method invocation. Classes inherit super-class methods with no overhead. We support mutually recursive classes while preserving separate compilation. Our strategy extends naturally to a significant subset of Java, including interfaces and privacy. The formal translation using Featherweight Java allows comprehensible type-preservation proofs and serves as a starting point for extending the translation to new features. Our work provides a foundation for supporting certifying compilation of Java-like class-based languages in a type-theoretic framework.

Event correlation has become the cornerstone of many reactive applications, particularly in distributed systems. However, support for programming with complex events is still rather specific and rudimentary. This paper presents EventJava, an extension of Java with generic support for event-based distributed programming. EventJava seamlessly integrates events with methods, and broadcasting with unicasting of events; it supports reactions to combinations of events, and predicates guarding those reactions. EventJava is implemented as a framework to allow for customization of event semantics, matching, and dispatching. We present its implementation, based on a compiler transforming specific primitives to Java, along with a reference implementation of the framework. We discuss ordering properties of EventJava through a formalization of its core as an extension of Featherweight Java. In a performance evaluation, we show that EventJava compares favorably to a highly tuned database-backed event correlation engine as well as to a comparably lightweight concurrency mechanism.

Lua is a small, embedded language to provide scripting in other languages. De- spite a clean, minimal syntax, it is still too complex for formal reasoning because of some syntactic sugar or specific syntax structures in Lua. This thesis develops Featherweight Lua (FWLua), following the tradition of lan- guages like Featherweight Java[1] and Featherweight JavaScript[2]. The goal is to develop a core of language features that, while remaining simple enough for formal reasoning, also remain faithful to the central characteristics of the language. Specifi- cally for Lua, the core features that are essential for our modeling include: ∙ First-class functions ∙ Tables as the central data construct ∙ Metatables that provide various “hooks” to change the behavior of tables To further validate this approach, we show how an extensive set of features from the full Lua programming language can be reduced to FWLua. Finally, we include a reference implementation written in Haskell as a tool for further testing and experimenting with the language. With this research, we provide a basis for future research into the Lua programming language.

We propose union types for statically typed class-based object-oriented languages as a means to enhance the flexibility of subtyping. As its name suggests, a union type can be considered a set union of instances of several types and behaves as their least common supertype. It also plays the role of an interface that 'factors out' commonality of given types---fields of the same name and methods with similar signatures. Union types can be useful for implementing heterogeneous collections and for grouping independently developed classes with similar interfaces, which has been considered difficult in languages like Java. To rigorously show the safety of union types, we formalize them on top of Featherweight Java and prove that the type system is sound.

A Rigorous Coupled Wave Analysis (RCWA) algorithm for electromagnetic (EM) scattering from radially and azimuthally inhomogeneous material elliptical systems based on State Variable (SV) techniques and based on circular-cylindrical Hankel-Bessel expansion modes is developed for the first time. The algorithm in conjunction with the elliptical system RCWA algorithm [1], which was based on SV techniques and Mathieu expansion modes, is used to validate and study numerical convergence of both elliptical RCWA algorithms. The formulation of the SV, Hankel-Bessel elliptical algorithm is presented. Two numerical elliptical examples are studied in detail by both algorithms, a homogeneous one which consists of three different uniform materials located in three elliptical regions and an inhomogeneous one which consists of an azimuthal, dielectric, step profile which is located between two uniform material elliptical regions. In this paper EM field scattering from a step profile which possessed a much larger dielectric step profile difference than was studied in [1] is presented. Validation and numerical convergence data of the Hankel-Bessel and the Mathieu [1] RCWA algorithm is presented for the first time, both in plot figures and in tables, when different numbers of expansion modes were used, when different number of layers were used, and when different numbers of SV harmonics were used. Validation of the RCWA algorithms was further carried out for the homogeneous case, by using Mathieu expansion modes in all regions and was carried out by using Hankel-Bessel expansion modes

From the practical perspective, with large-scale cargoes or nonnegligible hook masses, the centers of gravity of cargoes and hooks do not coincide with each other, and shipboard cranes usually exhibit complex double-pendulum effects during ship-to-ship or ship-to-harbor transportation, which dramatically increase the complexity of dynamic characteristics and make the control issue very challenging. At present, there is no reported work on control of double-pendulum shipboard cranes yet. To tackle such problems, this paper obtains the dynamic model of double-pendulum shipboard cranes and then provides an effective nonlinear antiswing feedback controller to achieve stable cargo transportation. Specifically, new state variable signals are generated by combining the original state variables with the ship motion (induced by sea wave perturbations). Based on this, by adding some elaborately designed nonlinear terms, an antiswing feedback controller is proposed, which can achieve stable transportation with suppressed swing, and the closed-loop asymptotic stability is proven without any linearizations or approximations to the original complex nonlinear dynamics, with rigorous theoretical analysis. As far as we know, the paper provides the first solution for both controller design and stability analysis of double-pendulum shipboard cranes. Also, several groups of hardware experiments are implemented on a self-built hardware experiment platform, which verify the effectiveness of the proposed method.

With strong load capacity and high maneuverability of payload attitude regulation, dual rotary cranes (DRCs) are widely applied for transportation and assembly tasks in infrastructure construction. For DRCs, to achieve safe and accurate control of the payload position and attitude, it is necessary to enhance the motion synchronization of two cranes, under the premise of controlling more state variables with fewer control inputs based on nonlinear coupling dynamics; moreover, the finite-time convergence of positioning errors is also expected to be guaranteed for high efficiency. To this end, this paper proposes an assembly-oriented finite-time coordinated controller <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">without</i> any linearization to the nonlinear crane dynamics, which realizes accurate and stable regulation of the payload position and attitude through coordinated boom motions. To our knowledge, the proposed controller provides the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">first</i> closed-loop control solution to realize both horizontal and non-horizontal payload hoisting for DRCs based on practical assembly demands. Theoretically, through elaborate design of the synchronization error and coupling errors, the real-time information exchange between the two cranes is realized for the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">first</i> time, which enhances the boom motion synchronization while suppressing payload swings. Furthermore, by introducing continuous terminal sliding mode surfaces with a multi-layer nested structure, the finite-time convergence of the boom positioning errors and the synchronization error is ensured with chattering reduction. Additionally, rigorous closed-loop stability analysis is provided based on Lyapunov techniques and Barbalat’s Lemma. Finally, the effectiveness and robustness of the proposed controller are verified by hardware experimental results. <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This paper is motivated by the coordinated motion control problem of dual rotary cranes (DRCs), which aims to achieve safe and accurate control of the payload position and attitude oriented on practical assembly demands. At present, most control methods for DRCs only realize horizontal payload transportation, which not only ignores the requirements of payload attitude regulation in assembly tasks, but also lacks the guarantee for boom motion coordination and the finite-time convergence of state variables. To address these issues, based on the nonlinear crane dynamics <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">without</i> any linearization, this paper proposes an assembly-oriented finite-time coordinated controller for DRCs, which achieves precise and stable regulation of the payload position and attitude through coordinated boom motions, and simultaneously enhances the system rapidity by ensuring the finite-time convergence of boom positioning errors. Furthermore, the detailed controller design and stability analysis process is provided, and the effectiveness of the proposed method is verified by hardware experiments. In the future research, we will try to apply the proposed method to practical operations of DRCs for complex assembly tasks of large heavy objects.

We investigate a mechanical model describing the evolution of damage in elastic and viscoelastic materials. The state variables are macroscopic deformations and the volume fraction of sound material. The equilibrium equations are recovered by refining the principle of virtual power including also microscopic forces. After proving an existence and uniqueness result for a regularized problem, we investigate the behaviour of solutions, in the case when a vanishing sequence of external forces is applied. By use of a rigorous asymptotics analysis, we show that macroscopic deformations can disappear at the limit, but their damaging effect remains in the equation describing the evolution of damage at a microscopic level. Moreover, it is proved that the balance of the energy is satisfied at the limit.

Rigorous coupled wave analysis (RCWA) approach is employed to determine electromagnetic (EM) scattering from cylindrical (circular and noncircular) spatially, inhomogeneous, anisotropic material objects. From the late 70's to the present, the RCWA approach has become an extremely important technique for the study of EM diffraction from one and two dimensional planar gratings. RCWA which is a spectral domain technique, is based on expanding Maxwell's equations in a set of Floquet harmonics, and from this expansion, arranging the unknowns of the system in a state variable (SV) form from which a solution may be found. For the study of diffraction from planar gratings, the technique has proved to be a very fast, accurate, and effective method which requires only the solution of relatively small matrix and eigenvalue equations. When the RCWA approach is applied to study scattering from two and three dimensional objects, the theta and phi azimuthal coordinates represent periodic coordinates from which Floquet harmonics may be used to expand the unknowns of the system. Secs. 1 and 2 will review the RCWA method and its application to E-mode planar diffraction gratings. Sec. 3 will present the basic RCWA EM formulation to study scattering from inhomogeneous, anisotopic circular, cylindrical objects, and Sec. 4 will briefly review the RCWA EM formulation used to study scattering from elliptical inhomogeneous objects.

We propose a conservative extension of the polymorphic lambda calculus ( F &amp;omega; ) as an intermediate language for compiling languages with name-based class and interface hierarchies. Our extension enriches standard F &amp;omega; with recursive types, existential types, and row polymorphism, but only ordered records with no subtyping. Basing our language on F &amp;omega; makes it also a suitable target for translation from other higher-order languages; this enables the safe interoperation between class-based and higher-order languages and the reuse of common type-directed optimization techniques, compiler back ends, and runtime support.We present the formal semantics of our intermediate language and illustrate its features by providing a formal translation from a subset of Java, including classes, interfaces, and private instance variables. The translation preserves the name-based hierarchical relation between Java classes and interfaces, and allows access to private instance variables of parameters of the same class as the one defining the method. It also exposes the details of method invocation and instance variable access and allows many standard optimizations to be performed on the object-oriented code.