Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
EPTCS ??, 20??, pp. 111, doi:10.4204/EPTCS.??.?? c Andreas Abel
 

Summary: FICS 2010
EPTCS ??, 20??, pp. 1≠11, doi:10.4204/EPTCS.??.??
c Andreas Abel
This work is licensed under the
Creative Commons Attribution License.
Type-Based Termination, Inflationary Fixed-Points,
and Mixed Inductive-Coinductive Types
Andreas Abel
Department of Computer Science
Ludwig-Maximilians-University Munich, Germany
andreas.abel@ifi.lmu.de
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 pro-
gram properties, and several type systems have been put forward that guarantee termination, com-
positionally. 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 implementa-
tion, MiniAgda, and we show in particular how it certifies productivity of corecursive and mixed

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences