A Poset Classifying Non-Commutative Term Orders
2001 ◽
Vol DMTCS Proceedings vol. AA,...
(Proceedings)
◽
International audience We study a poset $\Re$ on the free monoid (X*) on a countable alphabet X.This poset is determined by the fact that its total extensions are precisely the standard term orders on X*. We also investigate the poset classifying degree-compatible standard term orders, and the poset classifying sorted term orders. For the latter poset, we give a Galois coconnection with the Young lattice.
2007 ◽
Vol Vol. 9 no. 2
◽
2010 ◽
Vol Vol. 12 no. 4
◽
2009 ◽
Vol DMTCS Proceedings vol. AK,...
(Proceedings)
◽
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):