1021 search results - page 59 / 205 » Pure Subtype Systems |
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
This paper describes the baselines proposed for the ResPubliQA 2009 task. These baselines are purely based on information retrieval techniques. The selection of an adequate retrie...
ICFP
2010
ACM
13 years 9 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...
CTCS
1997
Springer
13 years 12 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
POPL
1991
ACM
13 years 11 months ago
1991
ACM
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...