Type Theory based on Dependent Inductive and Coinductive Types

We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly expressive. For example, all well-known basic types and type forme...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 327 - 336
Main Authors: Basold, Henning, Geuvers, Herman
Format: Conference Proceeding
Language:English
Published: New York, NY, USA ACM 05.07.2016
Series:ACM Conferences
Subjects:
Theory of computation > Logic
Theory of computation > Models of computation > Computability
Inductive Types
Coinductive Types
Fibrations
Dependent Types
ISBN:9781450343916, 1450343910
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first