33 search results - page 5 / 7 » Bounded polymorphism in session types |
ICFP
1999
ACM
13 years 12 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
CHI
2005
ACM
14 years 8 months ago
2005
ACM
We present a longitudinal study of mini-QWERTY keyboard use, examining the learning rates of novice miniQWERTY users. The study consists of 20 twenty-minute typing sessions using ...
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
IANDC
2006
13 years 7 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...