Computer Science – Logic in Computer Science
Scientific paper
2012-02-16
EPTCS 77, 2012, pp. 1-11
Computer Science
Logic in Computer Science
In Proceedings FICS 2012, arXiv:1202.3174
Scientific paper
10.4204/EPTCS.77.1
Type systems certify program properties in a compositional way. From a bigger program one can abstract out a part and certify the properties of the resulting abstract program by just using the type of the part that was abstracted away. Termination and productivity are non-trivial yet desired program properties, and several type systems have been put forward that guarantee termination, compositionally. These type systems are intimately connected to the definition of least and greatest fixed-points by ordinal iteration. While most type systems use conventional iteration, we consider inflationary iteration in this article. We demonstrate how this leads to a more principled type system, with recursion based on well-founded induction. The type system has a prototypical implementation, MiniAgda, and we show in particular how it certifies productivity of corecursive and mixed recursive-corecursive functions.
No associations
LandOfFree
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124923