479 search results - page 59 / 96 » Sound and Complete Type Inference for a Systems Programming ... |
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Ruby on Rails (or just “Rails”) is a popular web application framework built on top of Ruby, an objectoriented scripting language. While Ruby’s powerful features such as d...
TYPES
1998
Springer
13 years 12 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...