856 search results - page 16 / 172 » Dependent Types in Practical Programming |
CSFW
2004
IEEE
13 years 11 months ago
2004
IEEE
Our goal in this paper is to make secure information flow typing more practical. We propose simple and permissive typing rules for array operations in a simple sequential imperati...
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...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
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...
TLDI
2003
ACM
14 years 22 days ago
2003
ACM
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...