Sciweavers

1712 search results - page 197 / 343
» A Computational Approach to Binding Theory
Sort
View
WWW
2006
ACM
16 years 2 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
CADE
2006
Springer
16 years 2 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
15 years 10 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
FUZZIEEE
2007
IEEE
15 years 8 months ago
Tolerance-based and Fuzzy-Rough Feature Selection
— One of the main obstacles facing the application of computational intelligence technologies in pattern recognition (and indeed in many other tasks) is that of dataset dimension...
Richard Jensen, Qiang Shen
LICS
2007
IEEE
15 years 8 months ago
Environmental Bisimulations for Higher-Order Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii