7535 search results - page 8 / 1507 » A Type System for CHR |
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
ESOP
2012
Springer
12 years 3 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
ICFP
1999
ACM
13 years 12 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...