Sciweavers

153 search results - page 15 / 31
» Whither Written Language Evaluation
Sort
View
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
14 years 27 days ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
IJCNLP
2005
Springer
14 years 27 days ago
Using the Structure of a Conceptual Network in Computing Semantic Relatedness
Abstract. We present a new method for computing semantic relatedness of concepts. The method relies solely on the structure of a conceptual network and eliminates the need for perf...
Iryna Gurevych
LREC
2010
143views Education» more  LREC 2010»
13 years 8 months ago
Bigorna -- A Toolkit for Orthography Migration Challenges
Languages are born, evolve and, eventually, die. During this evolution their spelling rules (and sometimes the syntactic and semantic ones) change, putting old documents out of us...
José João Almeida, André Sant...
POPL
2002
ACM
14 years 7 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich