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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We describe a generic method to implement and extract partial recursive algorithms in Coq in a purely constructive way, using L… 
2015
2015
Homotopy type theory may be seen as an internal language for the ∞-category of weak ∞-groupoids. Moreover, weak ∞-groupoids model… 
2013
2013
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a… 
2012
2012
This article describes two stages of a study carried out with pre-university students, to gather information about the learning… 
2012
2012
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of… 
Review
2011
Review
2011
  • Stephanie Weirich
  • International Conference on Rewriting Techniques…
  • 2011
  • Corpus ID: 33499201
Programming languages based on dependent type theory promise two great advances: flexibility and security. With the type-level… 
2010
2010
ML5 is a programming language for spatially distributed computing, based on a Curry-Howard correspondence with the modal logic S5… 
2007
2007
We address the problem of representing mathematical structures in a proof assistant which: 1) is based on a type theory with… 
Highly Cited
2006
Highly Cited
2006
We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool… 
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…