On Coherence in Computer Algebra Export

@inproceedings{citeulike:405141, abstract = {. Modern computer algebra systems (e. g. AXIOM) support a rich type system including parameterized data types and the possibility of implicit coercions between types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important requirement is that all coercions between two types coincide, a property which is called coherence. We will prove a coherence theorem for a formal type system having several possibilities of...}, author = {Weber, Andreas}, booktitle = {Design and Implementation of Symbolic Computation Systems}, citeulike-article-id = {405141}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2528}, keywords = {algebra, category, coherence}, pages = {95--106}, posted-at = {2005-11-23 10:33:33}, priority = {2}, title = {On Coherence in Computer Algebra}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2528}, year = {1993} }

TY - CONF ID - citeulike:405141 L3 - citeulike-article-id:405141 N2 - . Modern computer algebra systems (e. g. AXIOM) support a rich type system including parameterized data types and the possibility of implicit coercions between types. In such a type system it will be frequently the case that there are different ways of building coercions between types. An important requirement is that all coercions between two types coincide, a property which is called coherence. We will prove a coherence theorem for a formal type system having several possibilities of... EP - 106 TI - On Coherence in Computer Algebra T2 - Design and Implementation of Symbolic Computation Systems SP - 95 KW - algebra KW - category KW - coherence AU - Weber, Andreas PY - 1993/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2528 ER -