4959 search results - page 534 / 992 » Imperative Functional Programming |
215
click to vote
PLDI
2011
ACM
14 years 10 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
195
click to vote
ESOP
2012
Springer
14 years 3 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
268
click to vote
ICFP
2012
ACM
13 years 10 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
315
click to vote
ASPLOS
2009
ACM
16 years 8 months ago
2009
ACM
Current shared memory multicore and multiprocessor systems are nondeterministic. Each time these systems execute a multithreaded application, even if supplied with the same input,...
327
Voted
POPL
2007
ACM
16 years 8 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...