7529 search results - page 91 / 1506 » The Modula-3 Type System |
117
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
129
click to vote
HOA
1993
15 years 8 months ago
1993
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
135
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
130
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...
154
click to vote
ICFP
2005
ACM
16 years 4 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...