479 search results - page 27 / 96 » Sound and Complete Type Inference for a Systems Programming ... |
AIED
2005
Springer
14 years 1 months ago
2005
Springer
Analyzing coverage of a student’s utterance or essay (completeness) and diagnosing errors (correctness) can be treated as a diagnosis problem and solved using a well-known techni...
TLCA
1997
Springer
13 years 11 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
ICLP
2003
Springer
14 years 26 days ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...