Name
Abstract | ||
|---|---|---|
Language designers have in recent years proposed a wealth of richer type systems for programming which seek to extend the range of statically enforced guarantees on data and code. Most such proposals have been evolutionary extensions of ML or Haskell, offering programmers a balanced compromise between expressive strength and existing well-understood technology. Typically they revolve around type- or kind-indexed types such as GADTs, supported by limited equality reasoning at the type-checking level, thus separating the dynamic behaviour of programs from the (simpler) static behaviour of indexing information occurring in their types.I want to argue in this talk for a more radical departure from such practice by examining full spectrum type dependency, lifting such restrictions on the data upon which types may depend. Conor McBride and I designed the language EPIGRAM for experiments in programming with inductive families of data (of which GADTs are a special case). Using it for illustration, I will explore some of the possibilities and challenges afforded by full spectrum type dependency at the static and dynamic level: types directly support modelling complex invariants in terms of other data (rather than their types), with a Curry-Howard flavour of data-as-evidence; such complexity is on a 'pay-as-you-go' basis, while keeping type annotations and other syntactic overheads to a minimum; data decomposition steps, e.g. case analysis, furnish more informative interactions between types and values during typechecking; such steps may moreover be abstractly specified by their types, and thus user definable; this supports a style of programming embracing 'learning by testing', views, and Burstall's 'hand simulation plus a little induction'; the absence of a rigid phase distinction need not lead to type-passing or excessive run-time overhead; effectful computation, in particular partiality, can be incorporated via variations on existing ideas such as monads.This talk is based on joint work with Conor McBride, Edwin Brady and Thorsten Altenkirch. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1145/1111037.1111038 | POPL |
Keywords | Field | DocType |
dynamic behaviour,case analysis,dynamic level,richer type system,kind-indexed type,full spectrum type dependency,data decomposition step,language epigram,conor mcbride,type annotation,dependent types matter,indexation,type system,programming language,spectrum,functional programming language,dependent types | Type system,Programming language,Computer science,Search engine indexing,Theoretical computer science,Haskell,Syntax,Type safety,Monad (functional programming),Computation,Special case | Conference |
Volume | Issue | ISSN |
41 | 1 | 0362-1340 |
ISBN | Citations | PageRank |
1-59593-027-2 | 28 | 1.82 |
References | Authors | |
27 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| james mckinna | 1 | 464 | 43.02 |