48 search results - page 1 / 10 » Epigram: Practical Programming with Dependent Types |
AFP
2004
Springer
13 years 10 months ago
2004
Springer
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
POPL
2006
ACM
14 years 4 months ago
2006
ACM
We exhibit the rationale behind the design of Epigram, a dependently typed programming language and interactive program development system, using refinements of a well known progr...
TYPES
2004
Springer
13 years 9 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
JFP
2007
13 years 4 months ago
2007
We present an approach to enriching the type system of ML with a restricted form of de