Sciweavers

1018 search results - page 9 / 204
» Generative unbinding of names
Sort
View
PLDI
2011
ACM
12 years 10 months ago
Systematic editing: generating program transformations from an example
Software modifications are often systematic—they consist of similar, but not identical, program changes to multiple contexts. Existing tools for systematic program transformati...
Na Meng, Miryung Kim, Kathryn S. McKinley
GPCE
2004
Springer
14 years 1 months ago
A Fresh Calculus for Name Management
Abstract. We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (...
Davide Ancona, Eugenio Moggi
COLING
2002
13 years 7 months ago
Unsupervised Named Entity Classification Models and their Ensembles
This paper proposes an unsupervised learning model for classifying named entities. This model uses a training set, built automatically by means of a small-scale named entity dicti...
Jae-Ho Kim, In-Ho Kang, Key-Sun Choi
AINA
2010
IEEE
14 years 26 days ago
Extracting Named Entities and Synonyms from Wikipedia
—In many search domains, both contents and searches are frequently tied to named entities such as a person, a company or similar. An example of such a domain is a news archive. O...
Christian Bohn, Kjetil Nørvåg
ENTCS
2007
86views more  ENTCS 2007»
13 years 7 months ago
Sequentiality and the CPS Semantics of Fresh Names
We investigate the domain-theoretic denotational semantics of a CPS with fresh name declaration. This is the target of a fully abstract CPS translation from the nu-calculus with ...
James Laird