564 search results - page 18 / 113 » Dependent types and program equivalence |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
OOPSLA
2009
Springer
14 years 2 months ago
2009
Springer
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
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...