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
Sets in homotopy type theory †
Homotopy type theory may be seen as an internal language for the ∞-category of weak ∞-groupoids. Moreover, weak ∞-groupoids model… 
2013
2013
Small Induction Recursion
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a… 
2012
2012
A Study about Students' Knowledge of Inductive Structures
This article describes two stages of a study carried out with pre-university students, to gather information about the learning… 
2012
2012
Refining Inductive Types
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of… 
Review
2011
Review
2011
Combining Proofs and Programs
  • 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
A Monadic Formalization of ML5
ML5 is a programming language for spatially distributed computing, based on a Curry-Howard correspondence with the modal logic S5… 
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… 
Highly Cited
2006
Highly Cited
2006
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool… 
2004
2004
A polymorphic representation of induction-recursion
The family T ∗ does not depend on the function g∗, because all calls to it have been replaced by f , and is not inductive… 
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)