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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities… (More)
Is this relevant?
2013
2013
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a… (More)
Is this relevant?
2012
2012
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a… (More)
Is this relevant?
2006
2006
We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool… (More)
  • figure 1
Is this relevant?
2004
2004
The family T ∗ does not depend on the function g∗, because all calls to it have been replaced by f , and is not inductive… (More)
Is this relevant?
2003
2003
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (generalized) inductive definitions… (More)
Is this relevant?
2002
2002
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive… (More)
Is this relevant?
2001
2001
We give two finite axiomatizations of indexed inductive-recursive definitions in intuitionistic type theory. They extend our… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The rst example of a simultaneous inductive-recursive deenition in intuitionistic type theory is Martin-LL of's universe a la… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Induction-recursion is a schema which formalizes the principles for introducing new sets in Martin-Löf’s type theory. It states… (More)
Is this relevant?