1054 search results - page 157 / 211 » A Formalization of the Turing Test |
123
Voted
CICLING
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
242
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
The search for proof and the search for counterexamples (bugs) are complementary activities that need to be pursued concurrently in order to maximize the practical success rate of...
262
Voted
POPL
2005
ACM
16 years 4 months ago
2005
ACM
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
142
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
141
Voted
ICFP
2001
ACM
16 years 4 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...