13734 search results - page 345 / 2747 » Abstractions of data types |
165
Voted
ACL
2008
15 years 9 months ago
2008
Parser self-training is the technique of taking an existing parser, parsing extra data and then creating a second parser by treating the extra data as further training data. Here ...
324
Voted
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
166
Voted
TLCA
2005
Springer
16 years 28 days ago
2005
Springer
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
207
click to vote
ESOP
2006
Springer
15 years 11 months ago
2006
Springer
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
194
Voted
EVOW
2010
Springer
16 years 17 days ago
2010
Springer
A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two scheme...