Flexible piezoresistive pressure sensors have been attracted a lot of attention due to their simple mechanism, easy fabrication, and convenient signal acquisition and analysis. Herein, a new flexible piezoresistive sensor based on microstructured electrospun rough polyurethane (PU) nanofibers film is assembled. The microstructured PU film with tiny bumps is prepared in one step via electrospinning technology, which imparts a microstructured rough upper surface and a smooth lower surface. With this unique microstructure, we have made it possible for PU/Ag films to serve as sensing layers for piezoresistive sensors by introducing a silver conductive layer on the surface of electrospun PU film. The fabricated piezoresistive pressure sensor delivers high sensitivity (10.53 kPa−1 in the range of 0–5 kPa and 0.97 kPa−1 in the range of 6–15 kPa), fast response time (60 ms), fast recovery time (30 ms), and long-time stability (over 10,000 cycles). This study presents a fabrication strategy to prepare the microstructured PU nanofiber film using electrospinning technology directly, and the as-developed sensor shows promise in applications such as wrist pulse measurement, finger movement monitoring, etc., proving its great potential for monitoring human activities.

Calculi with disjoint intersection types support a symmetric merge operator with subtyping. The merge operator generalizes record concatenation to any type, enabling expressive forms of object composition, and simple solutions to hard modularity problems. Unfortunately, recent calculi with disjoint intersection types and the merge operator lack a (direct) operational semantics with expected properties such as determinism and subject reduction, and only account for terminating programs. This paper proposes a type-directed operational semantics (TDOS) for calculi with intersection types and a merge operator. We study two variants of calculi in the literature. The first calculus, called λ i , is a variant of a calculus presented by Oliveira et al. (2016) and closely related to another calculus by Dunfield (2014). Although Dunfield proposes a direct small-step semantics for her calculus, her semantics lacks both determinism and subject reduction. Using our TDOS, we obtain a direct semantics for λ i that has both properties. The second calculus, called λ i + , employs the well-known subtyping relation of Barendregt, Coppo and Dezani-Ciancaglini (BCD). Therefore, λ i + extends the more basic subtyping relation of λ i , and also adds support for record types and nested composition (which enables recursive composition of merged components). To fully obtain determinism, both λ i and λ i + employ a disjointness restriction proposed in the original λ i calculus. As an added benefit the TDOS approach deals with recursion in a straightforward way, unlike previous calculi with disjoint intersection types where recursion is problematic. We relate the static and dynamic semantics of λ i to the original version of the calculus and the calculus by Dunfield. Furthermore, for λ i + , we show a novel formulation of BCD subtyping, which is algorithmic, has a very simple proof of transitivity and allows for the modular addition of distributivity rules (i.e. without affecting other rules of subtyping). All results have been fully formalized in the Coq theorem prover.

Modern functional programming languages such as Haskell support sophisticated forms of type-inference, even in the presence of higher-order polymorphism. Central to such advanced forms of typeinference is an algorithm for polymorphic subtyping. This paper formalizes an algorithmic specification for polymorphic subtyping in the Abella theorem prover. The algorithmic specification is shown to be decidable, and sound and complete with respect to Odersky and Läufer's well-known declarative formulation of polymorphic subtyping. While the meta-theoretical results are not new, as far as we know our work is the first to mechanically formalize them. Moreover, our algorithm differs from those currently in the literature by using a novel approach based on worklist judgements. Worklist judgements simplify the propagation of information required by the unification process during subtyping. Furthermore they enable a simple formulation of the meta-theoretical properties, which can be easily encoded in theorem provers.