@inproceedings{PintoJS:locgrsdespt,
	Abstract = {In this paper we give a graph-based decision procedure for a calculus with sum and product types. Although our motivation comes from the Bird-Meertens approach to reasoning algebraically about functional programs, the language used here can be seen as the internal language of a category with binary products and coproducts. As such, the decision procedure presented has independent interest.

A standard approach based on term rewriting would work modulo a set of equations; the present work proposes a simpler approach, based on graph-rewriting. We show in turn how the system covers reflection equational laws, fusion laws, and cancellation laws. },
	Annote = {DOI: 10.1016/j.entcs.2006.10.031},
	Author = {Jos\'e Bacelar Almeida and Jorge Sousa Pinto and Miguel Vila\c{c}a},
	Booktitle = {Proceedings of the 3rd. International Workshop on Term Graph Rewriting (TERMGRAPH'06)},
	Editor = {Ian Mackie},
	Keywords = {Graph-based decision procedure; point-free programming},
	Month = {April},
	Pages = {139-163},
	Series = {Electronic Notes in Theoretical Computer Science},
	Title = {A {L}ocal {G}raph-rewriting {S}ystem for {D}eciding  {E}quality in {S}um-product {T}heories},
	Volume = {176},
	Year = {2006}}