199 search results - page 21 / 40 » Combining Strict and Soft Typing in Functional Programming |
175
Voted
POPL
2008
ACM
16 years 17 hour ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...
CSL
2004
Springer
15 years 3 months ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
APLAS
2007
ACM
15 years 3 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
JMLR
2007
14 years 11 months ago
2007
A large number of variants of the Perceptron algorithm have been proposed and partially evaluated in recent work. One type of algorithm aims for noise tolerance by replacing the l...