Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,943,799 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
ALF (proof assistant)
Agda
Idris
Impredicativity
Expand
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
Dominique Larchey-Wendling
,
J. Monin
2018
Corpus ID: 208097793
We describe a generic method to implement and extract partial recursive algorithms in Coq in a purely constructive way, using L…
Expand
2015
2015
Sets in homotopy type theory †
E. Rijke
,
Bas Spitters
Mathematical Structures in Computer Science
2015
Corpus ID: 218071825
Homotopy type theory may be seen as an internal language for the ∞-category of weak ∞-groupoids. Moreover, weak ∞-groupoids model…
Expand
2013
2013
Small Induction Recursion
P. Hancock
,
Conor McBride
,
Neil Ghani
,
Lorenzo Malatesta
,
Thorsten Altenkirch
International Conference on Typed Lambda Calculus…
2013
Corpus ID: 906254
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a…
Expand
2012
2012
A Study about Students' Knowledge of Inductive Structures
S. D. Rosa
,
Alejandro Chmiel
Annual Workshop of the Psychology of Programming…
2012
Corpus ID: 17231203
This article describes two stages of a study carried out with pre-university students, to gather information about the learning…
Expand
2012
2012
Refining Inductive Types
R. Atkey
,
Patricia Johann
,
Neil Ghani
Log. Methods Comput. Sci.
2012
Corpus ID: 5933186
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of…
Expand
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…
Expand
2010
2010
A Monadic Formalization of ML5
Daniel R. Licata
,
R. Harper
International Workshop on Logical Frameworks and…
2010
Corpus ID: 8067350
ML5 is a programming language for spatially distributed computing, based on a Curry-Howard correspondence with the modal logic S5…
Expand
2007
2007
Working with Mathematical Structures in Type Theory
C. Coen
,
E. Tassi
Types for Proofs and Programs
2007
Corpus ID: 14748593
We address the problem of representing mathematical structures in a proof assistant which: 1) is based on a type theory with…
Expand
Highly Cited
2006
Highly Cited
2006
Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant
G. Barthe
,
Julien Forest
,
David Pichardie
,
Vlad Rusu
Fuji International Symposium on Functional and…
2006
Corpus ID: 12520604
We present a practical tool for defining and proving properties of recursive functions in the Coq proof assistant. The tool…
Expand
2004
2004
A polymorphic representation of induction-recursion
Venanzio Capretta
2004
Corpus ID: 12163581
The family T ∗ does not depend on the function g∗, because all calls to it have been replaced by f , and is not inductive…
Expand
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)
ACCEPT & CONTINUE