277 search results - page 24 / 56 » A First-Order Theory of Types and Polymorphism in Logic Prog... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
This paper introduces a pattern for almost compositional functions over recursive data types, and over families of mutually recursive data types. Here "almost compositional&q...
AOSD
2007
ACM
13 years 11 months ago
2007
ACM
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
ENTCS
2002
13 years 7 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...