10271 search results - page 543 / 2055 » Computer Science |
171
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
176
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
152
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
We consider here a number of variations on the System F, that are predicative second-order systems whose terms are intermediate between the Curry style and Church style. The terms ...
140
click to vote
SIAMDM
2010
15 years 5 months ago
2010
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...
168
click to vote
TCS
2010
15 years 5 months ago
2010
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...