Semi-continuous Sized Types and Termination

@article{Abel2006SemicontinuousST,
  title={Semi-continuous Sized Types and Termination},
  author={Andreas Abel},
  journal={Logical Methods in Computer Science},
  year={2006},
  volume={4}
}
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is only sound if the type of the recursive function is admissible, i.e… CONTINUE READING