8021 search results - page 99 / 1605 » A Type System for Tom |
142
click to vote
HOA
1993
15 years 9 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...
151
click to vote
ICFP
2010
ACM
15 years 6 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...
140
click to vote
ICFP
2008
ACM
16 years 5 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...
167
click to vote
ICFP
2005
ACM
16 years 5 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...
165
Voted
ESOP
1994
Springer
15 years 9 months ago
1994
Springer
Scientists and engineers must ensure that physical equations are dimensionally consistent, but existing programming languages treat all numeric values as dimensionless. This paper ...