Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Interactive Theorem Proving: 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings > Universe Polymorphism in Coq
Interactive Theorem Proving: 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings |
Gerwin Klein; Ruben Gamboa
Springer International Publishing
Interactive Theorem Proving: 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings
Universe Polymorphism in Coq
Authors

Matthieu Sozeau; Nicolas Tabareau

ARI Id

1664710971415_2857087

Access

Not Available Free

Pages

499-514

DOI

10.1007/978-3-319-08970-6_32

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-319-08970-6_32

Table of Contents of Book
Showing 1 to 20 of 39 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Microcode Verification – Another Piece of the Microprocessor Verification Puzzle
Jared Davis; Anna Slobodova; Sol Swords
1-16
Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK
Roderick Chapman; Florian Schanda
17-26
Towards a Formally Verified Proof Assistant
Abhishek Anand; Vincent Rahli
27-44
Implicational Rewriting Tactics in HOL
Vincent Aravantinos; Sofiène Tahar
45-60
A Heuristic Prover for Real Inequalities
Jeremy Avigad; Robert Y. Lewis; Cody Roux
61-76
A Formal Library for Elliptic Curves in the Coq Proof Assistant
Evmorfia-Iro Bartzia; Pierre-Yves Strub
77-92
Truly Modular (Co)datatypes for Isabelle/HOL
Jasmin Christian Blanchette; Johannes Hölzl; Andreas Lochbihler; Lorenz Panny; Andrei Popescu; Dmitriy Traytel
93-110
Cardinals in Isabelle/HOL
Jasmin Christian Blanchette; Andrei Popescu; Dmitriy Traytel
111-127
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
Sandrine Blazy; Vincent Laporte; David Pichardie
128-143
Showing Invariance Compositionally for a Process Algebra for Network Protocols
Timothy Bourke; Robert J. van Glabbeek; Peter Höfner
144-159
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
Frédéric Chyzak; Assia Mahboubi; Thomas Sibut-Pinote; Enrico Tassi
160-176
From Operational Models to Information Theory; Side Channels in pGCL with Isabelle
David Cock
177-192
A Coq Formalization of Finitely Presented Modules
Cyril Cohen; Anders Mörtberg
193-208
Formalized, Effective Domain Theory in Coq
Robert Dockins
209-225
Completeness and Decidability Results for CTL in Coq
Christian Doczkal; Gert Smolka
226-241
Hypermap Specification and Certified Linked Implementation Using Orbits
Jean-François Dufourd
242-257
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
Kento Emoto; Frédéric Loulergue; Julien Tesson
258-274
Experience Implementing a Performant Category-Theory Library in Coq
Jason Gross; Adam Chlipala; David I. Spivak
275-291
A New and Formalized Proof of Abstract Completion
Nao Hirokawa; Aart Middeldorp; Christian Sternagel
292-307
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 39 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings