On the unification problem for Cartesian closed categories

DOI10.2307/2275552zbMath0882.03044OpenAlexW2051020081MaRDI QIDQ4358059

Paliath Narendran, Richard Statman, Frank Pfenning

Publication date: 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275552

zbMATH Keywords

undecidabilitymatchingCartesian closed categoriesNP-completeunification problemsemantics of programming languagesunification modulo the linear isomorphisms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Undecidability and degrees of sets of sentences (03D35) Semantics in the theory of computing (68Q55) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (6)

An algorithm for distributive unification ⋮ Retrieving library functions by unifying types modulo linear isomorphism ⋮ Unification modulo homomorphic encryption ⋮ Unification and matching modulo nilpotence ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ Unification Modulo Homomorphic Encryption

Cites Work

• Unnamed Item
• Complexity of unification problems with associative-commutative operators
• Associative-commutative unification
• The category of finite sets and Cartesian closed categories
• Completion of a Set of Rules Modulo a Set of Equations
• A Unification Algorithm for Associative-Commutative Functions
• Complete Sets of Reductions for Some Equational Theories
• Provable isomorphisms of types
• Retrieving library functions by unifying types modulo linear isomorphism
• Using types as search keys in function libraries

This page was built for publication: On the unification problem for Cartesian closed categories