5415 search results - page 332 / 1083 » The Implementation of Functional Programming Languages |
208
click to vote
HASKELL
2005
ACM
16 years 8 days ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
154
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
231
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
Transactional memory (TM) provides a safer, more modular, and more scalable alternative to traditional lock-based synchronization. Implementing high performance TM systems has rec...
186
click to vote
LFP
1992
15 years 7 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
177
click to vote
POPL
1999
ACM
15 years 11 months ago
1999
ACM
Linking is a low-level task that is usually vaguely specified, if at all, by language definitions. However, the security of web browsers and other extensible systems depends cru...