Live briefing
Everything about Inductive type
Mathematical constructs and creation rules
In type theory, a system has inductive types if it has facilities for creating a new type from constants and functions that create terms of that type. The feature serves a role similar to data structures in a programming language and allows a type theory to add concepts like numbers, relations, and trees. As the name suggests, inductive types can be self-referential, but usually only in a way that permits structural recursion. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Inductive typeA 5-minute orientation
- Skim a recent paper: Design of coil parameters for inductive type wireless power transfer system in electric vehiclesInfluential work since 2022
- Pick up a classic book: Structural induction on partial algebrasThe most-reprinted book on the subject
- Read the landmark paper: A general formulation of simultaneous inductive-recursive definitions in type theoryCited 116 times
- Go sideways: CorecursionA closely related topic
- Go sideways: Agda (programming language)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A general formulation of simultaneous inductive-recursive definitions in type theory
Inductive types and type constraints in the second-order lambda calculus
π-calculus in (Co)inductive-type theory
Inductive-data-type systems
A Hyperthermia System Using a New Type of Inductive Applicator
Equivariant character correspondences and inductive McKay condition for type A
Constructing quotient inductive-inductive types
Magnetostrictive type inductive sensing pressure sensor
🆕 Influential since 2022
Design of coil parameters for inductive type wireless power transfer system in electric vehicles
Predicting and interpreting cell-type-specific drug responses in the small-data regime using inductive priors
Knowledge-based inductive bias and domain adaptation for cell type annotation
EXTENSIONS OF CHARACTERS IN TYPE D AND THE INDUCTIVE MCKAY CONDITION, I
Context-aware Inductive Knowledge Graph Completion with Latent Type Constraints and Subgraph Reasoning
📚 Books worth reading
- 📕Structural induction on partial algebrasHorst Reichel · 1984
Mathematical methods of specification and synthesis of software systems '85W. Bibel · 1986
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Corecursion In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling…
- Agda (programming language) Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with implementation…
- Intuitionistic type theory Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory (MLTT)) is a type theory and an alternative foundation of…
- Type theory In mathematical logic, and theoretical computer science, type theory is the study of formal systems that classify expressions or mathematical objects by…
- Identity type In type theory, a branch of mathematics, the identity type represents the concept of equality. It is also known as propositional equality to differentiate…
- Induction-induction In intuitionistic type theory (ITT), a discipline within mathematical logic, induction-induction is for simultaneously declaring some inductive type and…
- Recursive data type In computer programming, a recursive data type is a data type whose definition contains values of the same type. It is also known as a recursively defined…
- Induction-recursion In intuitionistic type theory (ITT), a discipline within mathematical logic, induction-recursion is a feature for simultaneously declaring a type and function…