User loginNavigation |
Constraint-Based Type Inference for Guarded Algebraic Data Types
Constraint-Based Type Inference for Guarded Algebraic Data Types
Quite a mouthful, but look: Guarded algebraic data types, which subsume the concepts known in the literature as indexed types, guarded recursive datatype constructors, and phantom types, and are closely related to inductive types, have the distinguishing feature that, when typechecking a function defined by cases, every branch must be checked under different typing assumptions. This mechanism allows exploiting the presence of dynamic tests in the code to produce extra static type information. I still have to grok this idea of "dynamic tests producing extra static type information" in its entirety, though. By Andris Birkmanis at 2004-08-09 20:48 | LtU Forum | previous forum topic | next forum topic | other blogs | 8220 reads
|
Browse archives
Active forum topics |
Recent comments
17 weeks 10 hours ago
17 weeks 10 hours ago
17 weeks 10 hours ago
23 weeks 21 hours ago
1 year 11 weeks ago
1 year 11 weeks ago
1 year 11 weeks ago
1 year 33 weeks ago
1 year 37 weeks ago
1 year 39 weeks ago