Hereditarily Finite Sets

swMATH29249MaRDI QIDQ40963FDOQ40963

Author name not available (Why is that?)

Described by source

• A Formalisation of Finite Automata Using Hereditarily Finite Sets

Cited In (5)

• Graph theory in Coq: minors, treewidth, and isomorphisms
• Hereditarily Finite Sets in Constructive Type Theory
• Formally verified algorithms for upper-bounding state space diameters
• Regular language representations in the constructive type theory of Coq
• Two-Way Automata in Coq

This page was built for software: Hereditarily Finite Sets