3047 search results - page 579 / 610 » On the Meaning of Logical Completeness |
168
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
174
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
176
Voted
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
173
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
157
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...