Substructural type systems are growing in popularity because they allow for a resourceful
interpretation of data which can be used to rule out various software bugs. Indeed …

Ownership and borrowing systems, designed to enforce safe memory management without
the need for garbage collection, have been brought to the fore by the Rust programming …

Graded modal logics generalise standard modal logics via families of modalities indexed by
an algebraic structure whose operations mediate between the different modalities. The …

Graded type systems are a class of type system for fine-grained quantitative reasoning about
data-flow in programs. Through the use of resource annotations (or grades), a programmer …

The recent notion of graded modal types provides a framework for extending type theories
with fine-grained data-flow reasoning. The Granule language explores this idea in the …

Session types provide guarantees about concurrent behaviour and can be understood
through their correspondence with linear logic, with propositions as sessions and proofs as …

Graded types are a class of resourcefultypes which allow for finegrained quantitative
reasoning about data-flow in programs. Tracing their roots from linear types, the use of …

The use of proof assistants as a tool for programming language theorists is becoming ever
more practical and widespread. There is a range of satisfactory implementations of simply …

The use of proof assistants as a tool for programming language theorists is becoming ever
more practical and widespread. There is a range of satisfactory implementations of simply …

The current mainstream programming languages do not explicitly track side effects of the
programs, such as the possibility of allocating memory, throwing an exception, and …