Type-level programming with match types

Match-O, A Dialect of Eiffel with Match-Types

Dependent Types for Low-Level Programming

In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that combines dependent types and mutation for variables and for heap-allocated structures in a more flexible way than before and (2) a technique for automatically inferring dependent types for local variables. We have appl...

Programming with ASN.1 Using Polymorphic Types and Type Specialization

A set of object-oriented abstractions is described that permits direct programming with ASN.1 speci ed types. The design and implementation also supports the exible use of di erent encoding rules. The implementation is in C++ and makes use of class templates for representing polymorphic types, class inheritance for type specialization, and typedefs for de ning ASN.1 types as instances of class ...

Generic Programming with Dependent Types

Some programs are doubly generic. For example, map is datatype-generic in that many different data structures support a mapping operation. A generic programming language like Generic Haskell can use a single definition to generate map for each type. However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments. For lists, this fam...

Imperative Programming with Dependent Types

In this paper, we enrich imperative programming with a form of dependent types. We start with explaining some motivations for this enrichment and mentioning some major obstacles that need to be overcome. We then present the design of a source level dependently typed imperative programming language Xanadu, forming both static and dynamic semantics and then establishing the type soundness theorem...