900 search results - page 12 / 180 » Pure Type Systems Formalized |
123
click to vote
POPL
1993
ACM
15 years 7 months ago
1993
ACM
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
113
Voted
FUIN
2002
15 years 3 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
112
click to vote
TLDI
2003
ACM
15 years 8 months ago
2003
ACM
We introduce an annotated type system for a compiler intermediate language. The type system is designed to support inter-procedural register allocation and the representation of t...
145
Voted
PPSWR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Time is omnipresent on the (Semantic) Web. However, formalism like XML, XML Schema, RDF, OWL and (Semantic) Web query languages have, if any, only very limited notions of...
130
click to vote
TCS
2008
15 years 3 months ago
2008
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...