1070 search results - page 40 / 214 » Type Classes with Functional Dependencies |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
TACAS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
ICFP
2005
ACM
14 years 7 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...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...