A field-theory motivated approach to symbolic computer algebra
<|reference_start|>A field-theory motivated approach to symbolic computer algebra: Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions, this often leads to cumbersome input formats, unexpected side-effects, or the need for a lot of special-purpose code. This makes a direct translation of problems from paper to computer and back needlessly time-consuming and error-prone. A prototype computer algebra system is presented which features TeX-like input, graph data structures, lists with Young-tableaux symmetries and a multiple-inheritance property system. The usefulness of this approach is illustrated with a number of explicit field-theory problems.<|reference_end|>
@article{peeters2006a,
    title={A field-theory motivated approach to symbolic computer algebra},
    author={Kasper Peeters},
    journal={Comput.Phys.Commun.176:550-558,2007},
    year={2006},
    doi={10.1016/j.cpc.2007.01.003},
    number={AEI-2006-037},
    archivePrefix={arXiv},
    eprint={cs/0608005},
    primaryClass={cs.SC gr-qc hep-th}
}