Skip to search formSkip to main contentSkip to account menu

Induction-recursion

Known as: Induction-recursion (type theory) 
In intuitionistic type theory (ITT), a discipline within mathematical logic, induction-recursion is a feature for simultaneously declaring a type and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
ALF (proof assistant)AgdaIdrisImpredicativity

Broader (1)

Type theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Simulating Induction-Recursion for Partial Algorithms
We describe a generic method to implement and extract partial recursive algorithms in Coq in a purely constructive way, using L… 
2015
2015
A Monadic Formalization of ML 5
2007
2007
Working with Mathematical Structures in Type Theory
We address the problem of representing mathematical structures in a proof assistant which: 1) is based on a type theory with… 
Review
2003
Review
2003
Veckoblad Från Matematiska Institutionen I Uppsala Universes for Inductive and Inductive-recursive Definitions in Martin-löf Type Theory Universes for Generic Programs and Proofs in Dependent Type…
Martin-Löf type theory is a formal and conceptual framework for constructive mathematics where induction and recursion are two… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)