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

DOI10.1007/978-3-642-39634-2zbMath1268.68006OpenAlexW2943841782MaRDI QIDQ2391534

No author found.

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)

Related Items (8)

Regular language representations in the constructive type theory of Coq ⋮ Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker ⋮ A formal proof in Coq of Lasalle's invariance principle ⋮ How to get more out of your oracles ⋮ Formalising Mathematics in Simple Type Theory ⋮ Formally proving size optimality of sorting networks ⋮ Markov chains and Markov decision processes in Isabelle/HOL ⋮ Unnamed Item

Uses Software

• Coq
• HOL Light
• Nuprl
• pGCL

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