Isomorphisms of generic recursive polynomial types
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Word problems, etc. in computability and recursion theory (03D40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(13)- On analytic groupoid cardinality
- Automorphisms of types and their applications
- An objective representation of the Gaussian integers
- Computing with semirings and weak rig groupoids
- Constructive membership predicates as index types
- Automorphisms of types in certain type theories and representation of finite groups
- Axioms and decidability for type isomorphism in the presence of sums
- Quantitative foundations for resource theories
- Randomised algorithms for isomorphisms of simple types
- Efficient algorithms for isomorphisms of simple types
- Efficient algorithms for isomorphisms of simple types
- Decidability properties of recursive types.
- Objects of categories as complex numbers
This page was built for publication: Isomorphisms of generic recursive polynomial types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452251)