1826 search results - page 217 / 366 » Using Random Forests in the Structured Language Model |
149
click to vote
FPCA
1995
15 years 10 months ago
1995
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
167
click to vote
SP
2007
IEEE
16 years 18 days ago
2007
IEEE
Information-flow security policies are an appealing way of specifying confidentiality and integrity policies in information systems. Most previous work on language-based securit...
167
Voted
DAC
2006
ACM
16 years 7 months ago
2006
ACM
or Abstraction for the Functional Verification of FPGAs Guy Dupenloup, Thierry Lemeunier, Roland Mayr Altera Corporation 101 Innovation Drive San Jose, CA 95134 1-408-544-8672 {gdu...
158
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
175
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...