Sciweavers

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

60

Voted

TLCA
1993
Springer

favoriteEmaildiscussreport

102views Theoretical Computer Science» more TLCA 1993»

Pure Type Systems Formalized

15 years 1 months ago

Pure Type Systems Formalized

Download eref.uqu.edu.sa

James McKinna, Robert Pollack

Real-time Traffic

Theoretical Computer Science | TLCA 1993 |

claim paper

Related Content

» Pure Type Systems in Rewriting Logic Specifying Typed HigherOrder Languages in a FirstOrde...

» Pure patterns type systems

» Pure Subtype Systems

» Lightweight semiformal time complexity analysis for purely functional data structures

» Pure Type Systems without Explicit Contexts

» Equality Is Typable in Semifull Pure Type Systems

» Embedding Pure Type Systems in the LambdaPiCalculus Modulo

» Erasure and Polymorphism in Pure Type Systems

» The Simplytyped Pure Pattern Type System Ensures Strong Normalization

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	TLCA
Authors	James McKinna, Robert Pollack

Comments (0)