Efficient algorithms for isomorphisms of simple types

DOI10.1017/S0960129505004913zbMath1084.68024OpenAlexW2017381226MaRDI QIDQ5896791

Yoav Zibin, Joseph (Yossi) Gil

Publication date: 10 March 2006

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129505004913

zbMATH Keywords

first-order isomorphism problem

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Extensional proofs in a propositional logic modulo isomorphisms ⋮ Generic top-down discrimination for sorting and partitioning in linear time ⋮ Automorphisms of types and their applications

This page was built for publication: Efficient algorithms for isomorphisms of simple types