Sciweavers

564 search results - page 11 / 113
» Dependent types and program equivalence
Sort
View
LICS
2008
IEEE
14 years 2 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
PLPV
2009
ACM
14 years 4 months ago
Type invariants for Haskell
Haskell’s multi-parameter type classes, together with functional dependencies, allow the specification of complex type-level opera
Tom Schrijvers, Louis-Julien Guillemette, Stefan M...
APLAS
2004
ACM
14 years 1 months ago
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
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...
Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
ESOP
2000
Springer
13 years 11 months ago
Type Classes with Functional Dependencies
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 ...
Mark P. Jones
FLOPS
2008
Springer
13 years 9 months ago
On-Demand Refinement of Dependent Types
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...
Hiroshi Unno, Naoki Kobayashi