Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
: A Core Language for Dependently Typed Programming Thorsten Altenkirch Nicolas Oury
 

Summary: DRAFT
: A Core Language for Dependently Typed Programming
Thorsten Altenkirch Nicolas Oury
University of Nottingham
{txa,npo}@cs.nott.ac.uk
Abstract
We introduce , a core language for dependently typed program-
ming. Our intention is that should play the role extensions of
System F are playing for conventional functional languages with
polymorphism, like Haskell. The core language incorporates mu-
tual dependent recursive definitions, Type : Type, - and -types,
finite sets of labels and explicit constraints. We show that standard
constructions in dependently typed programming can be easily en-
coded in our language. We address some important issues: having
an equality checker which unfolds recursion only when needed,
avoiding looping when typechecking sensible programs; the sim-
plification of type checking for eliminators like case by using equa-
tional constraints, allowing the flexible use of case expressions
within dependently typed programming and the representation of
dependent datatypes using explicit constraints.

  

Source: Altenkirch, Thorsten - School of Computer Science, University of Nottingham

 

Collections: Computer Technologies and Information Sciences