564 search results - page 11 / 113 » Dependent types and program equivalence |
137
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
113
click to vote
PLPV
2009
ACM
16 years 1 months ago
2009
ACM
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
138
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 9 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...
120
click to vote
ESOP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
144
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...