d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Abstract. Recently, there has been much interest in multi-party session types (MPSTs) as a means of rigorously specifying protocols for interaction among multiple distributed parti...
K. C. Sivaramakrishnan, Karthik Nagaraj, Lukasz Zi...
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product f...
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...