Sciweavers

3819 search results - page 243 / 764
» Simple Easy Terms
Sort
View
ICFP
2004
ACM
16 years 7 months ago
Making a fast curry: push/enter vs. eval/apply for higher-order languages
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
Simon Marlow, Simon L. Peyton Jones
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
16 years 2 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
ICASSP
2009
IEEE
16 years 2 months ago
Unsupervised pronunciation validation
This paper addresses selecting between candidate pronunciations for out-of-vocabulary words in speech processing tasks. We introduce a simple, unsupervised method that outperforms...
Christopher M. White, Abhinav Sethy, Bhuvana Ramab...
ERCIMDL
2009
Springer
108views Education» more  ERCIMDL 2009»
16 years 1 months ago
Hoppla - Digital Preservation Support for Small Institutions
Small businesses (small office/home office, SOHO) have tremendous amounts of digital information. At the same time, they have little to no expertise on how to manage it, not to me...
Stephan Strodl, Florian Motlik, Andreas Rauber
HASKELL
2009
ACM
16 years 1 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones