MiniAgda: Integrating Sized and Dependent Types

Details MiniAgda: Integrating Sized and Dependent Types MiniAgda: Integrating Sized and Dependent Types

2010-12-22

arxiv.org/abs/1012.4896v1

EPTCS 43, 2010, pp. 14-28

Computer Science

Programming Languages

In Proceedings PAR 2010, arXiv:1012.4555

Scientific paper

10.4204/EPTCS.43.2

Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track structural descent and guardedness in the type system to make termination checking robust and suitable for strong abstractions like higher-order functions and polymorphism. To study the application of sized types to proof assistants and programming languages based on dependent type theory, we have implemented a core language, MiniAgda, with explicit handling of sizes. New considerations were necessary to soundly integrate sized types with dependencies and pattern matching, which was made possible by concepts such as inaccessible patterns and parametric function spaces. This paper provides an introduction to MiniAgda by example and informal explanations of the underlying principles.

Affiliated with

Also associated with

No associations

Rating

MiniAgda: Integrating Sized and Dependent 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 MiniAgda: Integrating Sized and Dependent Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MiniAgda: Integrating Sized and Dependent Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581938