Don’t miss the next upload by paperswelove!

Join free & follow paperswelove to be the first to hear it.

Join & follow
Gershom Bazerman on "Homological Computations for Term Rewriting Systems"

Gershom Bazerman on "Homological Computations for Term Rewriting Systems"

Meetup: http://bit.ly/2y3Qc1j
Paper: http://math.univ-lyon1.fr/~malbos/Art/hcTRS.pdf
Slides: http://bit.ly/2xMQoBa
Video: https://youtu.be/WdawrT-6Qzk

-----------------------------------------------------------------------------------
Sponsored and hosted by Two Sigma (@twosigma)
-----------------------------------------------------------------------------------

Description
------------------
In 1987, C. Squier wrote "Word problems and a homological finiteness condition for monoids," which proved a fascinating result that spawned an entire field, but which is little known outside of it. The great mathematical popularizer and category theorist John Baez sketched the ideas in 1995. We consider "word problems," which ask the equality of two terms modulo a set of equivalences, restrict ourselves to simple objects called "monoids" that many functional programmers are fond of, and ask about the decidability of equality over them...

Comments