| | |
Summary: : Dependent Types without the Sugar
Thorsten Altenkirch1
, Nils Anders Danielsson1
,
Andres L¨oh2
, and Nicolas Oury3
1
School of Computer Science, University of Nottingham
2
Institute of Information and Computing Sciences, Utrecht University
3
Division of Informatics, University of Edinburgh
Abstract. The recent success of languages like Agda and Coq demon-
strates the potential of using dependent types for programming. These
systems rely on many high-level features like datatype definitions, pat-
tern matching and implicit arguments to facilitate the use of the lan-
guages. However, these features complicate the metatheoretical study
and are a potential source of bugs.
To address these issues we introduce , a dependently typed core lan-
guage. It is small enough for metatheoretical study and the type checker
|
