703 search results - page 19 / 141 » Fundamentals of Session Types |
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...
CSEE
2010
Springer
13 years 5 months ago
2010
Springer
This paper shares the experiences and lessons learned from conducting an NSF-sponsored eight-week summer research program for ten undergraduate students from multiple universities...
ICFP
2010
ACM
13 years 7 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
ISVLSI
2003
IEEE
14 years 28 days ago
2003
IEEE
The behavior of many algorithms is heavily determined by the input data. Furthermore, this often means that multiple and completely different execution paths can be followed, also...