Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
30
views
14
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,026
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
A Coq Formalization of Finitely Presented Modules
other
Author(s):
Cyril Cohen
,
Anders Mörtberg
Publication date
(Print):
2014
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
14
Record
: found
Abstract
: not found
Article
: not found
Elementary divisors and modules
Irving Kaplansky
(1949)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Packaging Mathematical Structures
François Garillot
,
Georges Gonthier
,
Assia Mahboubi
…
(2009)
0
comments
Cited
23
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
A Course in Constructive Algebra
Ray Mines
,
Fred Richman
,
Wim Ruitenburg
(1988)
0
comments
Cited
18
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 193-208
DOI:
10.1007/978-3-319-08970-6_13
SO-VID:
6865e701-a9ad-472c-b7bc-a5811c1cf055
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Microcode Verification – Another Piece of the Microprocessor Verification Puzzle
pp. 17
Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK
pp. 27
Towards a Formally Verified Proof Assistant
pp. 45
Implicational Rewriting Tactics in HOL
pp. 61
A Heuristic Prover for Real Inequalities
pp. 77
A Formal Library for Elliptic Curves in the Coq Proof Assistant
pp. 93
Truly Modular (Co)datatypes for Isabelle/HOL
pp. 111
Cardinals in Isabelle/HOL
pp. 128
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
pp. 144
Showing Invariance Compositionally for a Process Algebra for Network Protocols
pp. 160
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
pp. 177
From Operational Models to Information Theory; Side Channels in pGCL with Isabelle
pp. 193
A Coq Formalization of Finitely Presented Modules
pp. 209
Formalized, Effective Domain Theory in Coq
pp. 226
Completeness and Decidability Results for CTL in Coq
pp. 242
Hypermap Specification and Certified Linked Implementation Using Orbits
pp. 258
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
pp. 275
Experience Implementing a Performant Category-Theory Library in Coq
pp. 292
A New and Formalized Proof of Abstract Completion
pp. 308
HOL with Definitions: Semantics, Soundness, and a Verified Implementation
pp. 325
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
pp. 341
Recursive Functions on Lazy Lists via Domains and Topologies
pp. 358
Formal Verification of Optical Quantum Flip Gate
pp. 374
Compositional Computational Reflection
pp. 390
An Isabelle Proof Method Language
pp. 406
Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete
pp. 421
The Reflective Milawa Theorem Prover Is Sound
pp. 437
Balancing Lists: A Proof Pearl
pp. 450
Unified Decision Procedures for Regular Expression Equivalence
pp. 467
Collaborative Interactive Theorem Proving with Clide
pp. 483
On the Formalization of Z-Transform in HOL
pp. 499
Universe Polymorphism in Coq
pp. 515
Asynchronous User Interaction and Tool Integration in Isabelle/PIDE
pp. 531
HOL Constant Definition Done Right
pp. 537
Rough Diamond: An Extension of Equivalence-Based Rewriting
pp. 543
Formal C Semantics: CompCert and the C Standard
pp. 549
Mechanical Certification of Loop Pipelining Transformations: A Preview
Similar content
3,026
The Role of Sulfide Oxidation Impairment in the Pathogenesis of Primary CoQ Deficiency
Authors:
Catarina Quinzii
,
Marta Luna-Sánchez
,
Marcello Ziosi
…
A membrane feeding technique for the infection of Culicoides nubeculosus mg and Culicoides variipennis sonorensis coq with Onchocerca cervicalis Rail and Henry
Authors:
P.S. Mellor
,
P.S. MELLOR
Extracting Smart Contracts Tested and Verified in Coq
Authors:
Danil Annenkov
,
Mikkel Milo
,
Jakob Nielsen
…
See all similar