Interactive theorem proving. 4th international conference, ITP 2013, Rennes, France, July 22--26, 2013. Proceedings

DOI10.1007/978-3-642-39634-2MaRDI QIDQ2391534zbMATH OpenOpenAlexFDO

Authors

Publication date 31 July 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39634-2

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(9)

• Formalization \textit{of} quantum protocols using Coq
• How to get more out of your oracles
• Formalising Mathematics in Simple Type Theory
• Regular language representations in the constructive type theory of Coq
• Formalizing size-optimal sorting networks: extracting a certified proof checker
• Formally proving size optimality of sorting networks
• A formal proof in Coq of Lasalle's invariance principle
• Markov chains and Markov decision processes in Isabelle/HOL
• Interactive theorem proving. 7th international conference, ITP 2016, Nancy, France, August 22--25, 2016. Proceedings

Describes a project that uses

Uses Software

• pGCL
• Nuprl
• HOL Light
• Coq

This page was built for publication: Interactive theorem proving. 4th international conference, ITP 2013, Rennes, France, July 22--26, 2013. Proceedings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391534)