TLDI 2005 | Sciweavers

11

TLDI
2005
ACM

102views Formal Methods» more TLDI 2005»

13 years 10 months ago

Two diﬀerent ways of deﬁning ad-hoc polymorphic operations commonly occur in programming languages. With the ﬁrst form polymorphic operations are deﬁned inductively on the...

Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...

claim paper

Read More »

13

click to vote

TLDI
2005
ACM

135views Formal Methods» more TLDI 2005»

Types for describing coordinated data structures

13 years 10 months ago

Download www.cs.washington.edu

Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....

Michael F. Ringenburg, Dan Grossman

claim paper

Read More »

8

click to vote

TLDI
2005
ACM

126views Formal Methods» more TLDI 2005»

Type inference for atomicity

13 years 10 months ago

Download www.cs.williams.edu

Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...

Cormac Flanagan, Stephen N. Freund, Marina Lifshin

claim paper

Read More »

17

click to vote

TLDI
2005
ACM

151views Formal Methods» more TLDI 2005»

Strict bidirectional type checking

13 years 10 months ago

Download www.cs.cmu.edu

Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...

Adam J. Chlipala, Leaf Petersen, Robert Harper

claim paper

Read More »

10

click to vote

TLDI
2005
ACM

118views Formal Methods» more TLDI 2005»

Non-interference for a JVM-like language

13 years 10 months ago

Download www.it.uu.se

Gilles Barthe, Tamara Rezk

claim paper