Dependently typed programming in agda
Paper in proceeding, 2009
In Hindley-Milner style languages, such as Haskell and ML, there is a clear separation between types and values. In a dependently typed language the line is more blurry - types can contain (depend on) arbitrary values and appear as arguments and results of ordinary functions.
Author
Ulf Norell
Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
03029743 (ISSN) 16113349 (eISSN)
Vol. 5832 LNCS 230-266978-364204651-3 (ISBN)
Subject Categories
Computer and Information Science
DOI
10.1007/978-3-642-04652-0_5
ISBN
978-364204651-3