194 search results - page 8 / 39 » A Rewriting Semantics for Type Inference |
231
click to vote
ICFP
2009
ACM
16 years 3 months ago
2009
ACM
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
153
click to vote
CCS
2005
ACM
15 years 8 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
113
click to vote
ESOP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
111
click to vote
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
145
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...