NYU Faculty Digital Archive
metadata only
ORDER-SORTED RIGID E-UNIFICATION
Rigid E-Unification is a special type of unification which arises naturally when extending Andrew's method of matings to logic with equality. We study the rigid E-Unification problem in the presence of subsorts. We present an order sorted method for the computation of order sorted rigid-E-unifier
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Unifying Execution of Imperative and Declarative Code#337936
- Why Must Incompatibility Be Symmetric?#94792
- Microparticle sorting method and microchip for sorting microparticles — Sony Corporation (US11148173B2)#607732
- Graph-Based Information Processing : Scaling Laws and Applications#320085
- Practices of comparison and the making of international orders#779263
Record · ID 933494
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive