1948 search results - page 205 / 390 » Formalizing Mirror Theory |
264
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
327
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
286
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
255
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
281
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a notion of guarded recursive (g.r.) datatype constructors, generalizing the notion of recursive datatypes in functional programming languages such as ML and Haskell....