Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

RTA
2010
Springer

favoriteEmaildiscussreport

91views Theoretical Computer Science» more RTA 2010»

The Undecidability of Type Related Problems in Type-free Style System F

13 years 3 months ago

The Undecidability of Type Related Problems in Type-free Style System F

Download drops.dagstuhl.de

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 here contain the information on where the universal quantiﬁer elimination

Ken-etsu Fujita, Aleksy Schubert

Real-time Traffic

Curry Style | Predicative Second-order | RTA 2010 | Theoretical Computer Science | Universal Quantiﬁer Elimination |

claim paper

Related Content

» Type inference in intuitionistic linear logic

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	RTA
Authors	Ken-etsu Fujita, Aleksy Schubert

Comments (0)