277 search results - page 6 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
239
click to vote
POPL
2006
ACM
16 years 4 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...
151
click to vote
TLDI
2009
ACM
16 years 1 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...
119
click to vote
ICLP
1995
Springer
15 years 7 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
149
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
130
click to vote
ICFP
2000
ACM
15 years 8 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...