Dependently typed programming in agda
Paper i 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.

Författare

Ulf Norell

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 5832 LNCS 230-266

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/978-3-642-04652-0_5

ISBN

978-364204651-3