Some Wellfounded Trees in UniMath
From MaRDI portal
Recommendations
- Uniforming n-place functions on ds(alpha)
- scientific article; zbMATH DE number 6680130
- Some model theory for generalized trees
- Unification of kinded infinite trees
- Uniformization, choice functions and well orders in the class of trees
- Trees, ultrametric spaces and bases with uniform structure
- scientific article; zbMATH DE number 1990727
- Inducibility and universality for trees
- Types for Proofs and Programs
- Unions of random trees and applications
Cites work
- scientific article; zbMATH DE number 6694181 (Why is no real title available?)
- scientific article; zbMATH DE number 3458870 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- An experimental library of formalized mathematics based on the univalent foundations
- An introduction to small scale reflection in Coq
- Cubical type theory: a constructive interpretation of the univalence axiom
- Inductive types in homotopy type theory
- Non-wellfounded trees in homotopy type theory
- Substitution in non-wellfounded syntax with variable binding
- Univalent categories and the Rezk completion
- de Bruijn notation as a nested datatype
Cited in
(5)
This page was built for publication: Some Wellfounded Trees in UniMath
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819193)