360 search results - page 13 / 72 » Dependently Typed Programming in Agda |
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
GPCE
2008
Springer
13 years 8 months ago
2008
Springer
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...