4757 search results - page 492 / 952 » Monads for Functional Programming |
168
Voted
ESOP
2012
Springer
14 years 2 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...
287
Voted
ASPLOS
2009
ACM
16 years 7 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,...
298
Voted
POPL
2007
ACM
16 years 7 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...
330
Voted
POPL
2005
ACM
16 years 7 months ago
2005
ACM
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
178
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...