74 search results - page 4 / 15 » Type Inferencing for Polymorphic Order-Sorted Logic Programs |
135
Voted
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
131
Voted
ICFP
2002
ACM
16 years 2 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
218
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
128
Voted
FLOPS
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
136
Voted
TLDI
2009
ACM
15 years 11 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...