Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,394,724 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
A Monadic Formalization of ML 5
Daniel R. Licata
,
R. Harper
2015
Corpus ID: 34218769
2007
2007
Working with Mathematical Structures in Type Theory
C. S. 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
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…
D. Hejhal
2003
Corpus ID: 17434353
Martin-Löf type theory is a formal and conceptual framework for constructive mathematics where induction and recursion are two…
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