5090 search results - page 349 / 1018 » Constructing Strategies for Programming |
260
click to vote
POPL
2004
ACM
16 years 6 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...
284
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
286
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
164
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
150
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...