An Agda formalization of Üresin \& Dubois' asynchronous fixed-point theory

DOI10.1007/978-3-319-94821-8_37zbMath1468.68311OpenAlexW2810557480MaRDI QIDQ1791213

Timothy G. Griffin, Ran Zmigrod, Matthew L. Daggitt

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94821-8_37

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

A relaxation of Üresin and Dubois' asynchronous fixed-point theory in Agda ⋮ RoutingLib

Uses Software

• Agda

This page was built for publication: An Agda formalization of Üresin \& Dubois' asynchronous fixed-point theory