As an important component of prehistoric subsistence, an understanding of bone-working is essential for interpreting the evolution of early complex societies, yet worked bones are rarely systematically collected in China. Here, the authors apply multiple analytical methods to worked bones from the Longshan site of Pingliangtai, in central China, showing that Neolithic bone-working in this area, with cervid as the main raw material, was mature but localised, household-based and self-sufficient. The introduction of cattle in the Late Neolithic precipitated a shift in bone-working traditions but it was only later, in the Bronze Age, that cattle bones were utilised in a specialised fashion and dedicated bone-working industries emerged in urban centres.

Traditional designs for functional languages (such as Haskell or ML) have separate sorts of syntax for terms and types. In contrast, many dependently typed languages use a unified syntax that accounts for both terms and types. Unified syntax has some interesting advantages over separate syntax, including less duplication of concepts, and added expressiveness. However, integrating unrestricted general recursion in calculi with unified syntax is challenging when some level of type-level computation is present, since properties such as decidable type-checking are easily lost. This paper presents a family of calculi called pure iso-type systems (PITSs), which employs unified syntax, supports general recursion and preserves decidable type-checking. PITS is comparable in simplicity to pure type systems (PTSs), and is useful to serve as a foundation for functional languages that stand in-between traditional ML-like languages and fully blown dependently typed languages. In PITS, recursion and recursive types are completely unrestricted and type equality is simply based on alpha-equality, just like traditional ML-style languages. However, like most dependently typed languages, PITS uses unified syntax, naturally supporting many advanced type system features. Instead of implicit type conversion, PITS provides a generalization of iso-recursive types called iso-types. Iso-types replace the conversion rule typically used in dependently typed calculus and make every type-level computation explicit via cast operators. Iso-types avoid the complexity of explicit equality proofs employed in other approaches with casts. We study three variants of PITS that differ on the reduction strategy employed by the cast operators: call-by-name, call-by-value and parallel reduction. One key finding is that while using call-by-value or call-by-name reduction in casts loses some expressive power, it allows those variants of PITS to have simple and direct operational semantics and proofs. In contrast, the variant of PITS with parallel reduction retains the expressive power of PTS conversion, at the cost of a more complex metatheory.

Developing metal-based composite coatings with improved mechanical properties and good corrosion resistance has been an attractive research topic in recent years. Graphene (Gr), as a new type of two-dimensional (2D) carbon nanomaterial with excellent physical, chemical and mechanical properties, can be used as a reinforcement to improve hardness, tensile strength, wear and corrosion resistance of metal-based composites. There have been substantial efforts focused on the fabrication of metal-Gr composite coatings via various approaches. Electro-deposition is an effective electrochemical method with wide range of advantages, such as a fast deposition rate, simple set-up with large scale production and relatively low cost. This overview covers the previous research and development studies on metal-Gr composite coatings using electro-deposition method and the resulting properties. In addition, recent work in this area which provides a developed process with industrial production perspective, is discussed.