Sciweavers

2803 search results - page 560 / 561
» A Type System for Prototyping Languages
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 5 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
LRE
2006
175views more  LRE 2006»
13 years 5 months ago
Automatically generating related queries in Japanese
Web searchers reformulate their queries, as they adapt to search engine behavior, learn more about a topic, or simply correct typing errors. Automatic query rewriting can help user...
Rosie Jones, Kevin Bartz, Pero Subasic, Benjamin R...
ITPRO
2007
101views more  ITPRO 2007»
13 years 5 months ago
Beyond Search: Content Applications
Federation of Abstracting and Information Services presentation (“TheThomsonTransformation: Remaking a Global 500 Company,” http://www. nfais.org/TurnerNFAIS06.ppt). Now conten...
Stephen Buxton
PVLDB
2008
124views more  PVLDB 2008»
13 years 4 months ago
Google's Deep Web crawl
The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structu...
Jayant Madhavan, David Ko, Lucja Kot, Vignesh Gana...
LICS
2010
IEEE
13 years 3 months ago
Polarity and the Logic of Delimited Continuations
Abstract—Polarized logic is the logic of values and continuations, and their interaction through continuation-passing style. The main limitations of this logic are the limitation...
Noam Zeilberger