4757 search results - page 380 / 952 » Monads for Functional Programming |
182
Voted
RIA
2007
15 years 6 months ago
2007
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
190
click to vote
CCS
2011
ACM
14 years 6 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
259
Voted
POPL
2001
ACM
16 years 7 months ago
2001
ACM
By combining existing type systems with standard typebased compilation techniques, we describe how to write strongly typed programs that include a function that acts as a tracing ...
159
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
174
Voted
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We have added a Java virtual machine (henceforth JVM) bytecode generator to the optimizing Scheme-to-C compiler Bigloo. We named this new compiler BiglooJVM. We have used this new...