Isomorphisms of generic recursive polynomial types

DOI10.1145/964001.964008zbMath1325.68063OpenAlexW1978523506MaRDI QIDQ3452251

Marcelo P. Fiore

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964008

zbMATH Keywords

Gröbner basessemigroupsword problemtype theoryrecursive typesdata structuretype isomorphismrigs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Theory of programming languages (68N15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

An objective representation of the Gaussian integers ⋮ On analytic groupoid cardinality ⋮ Objects of categories as complex numbers ⋮ Unnamed Item ⋮ Computing with Semirings and Weak Rig Groupoids ⋮ Automorphisms of types in certain type theories and representation of finite groups ⋮ Constructive Membership Predicates as Index Types