Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jose Divasón, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada 0002. Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). In June Andronick, Amy P. Felty, editors, Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018. pages 2-13, ACM, 2018. [doi]

This author has not been identified. Look up 'Jose Divasón' in GoogleThis author has not been identified. Look up 'Sebastiaan J. C. Joosten' in GoogleThis author has not been identified. Look up 'Ondrej Kuncar' in GoogleThis author has not been identified. Look up 'René Thiemann' in GoogleThis author has not been identified. Look up 'Akihisa Yamada 0002' in Google

runs on WebDSL