Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
24
views
2
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,431
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
The Isabelle Collections Framework
other
Author(s):
Peter Lammich
,
Andreas Lochbihler
Publication date
(Print):
2010
Publisher:
Springer Berlin Heidelberg
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
Open source discrete and agent-based modeling frameworks for biology
Most cited references
2
Record
: found
Abstract
: not found
Book Chapter
: not found
Imperative Functional Programming with Isabelle/HOL
Lukas Bulwahn
,
Alexander Krauss
,
Florian Haftmann
…
(2008)
0
comments
Cited
17
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Interpretation of Locales in Isabelle: Theories and Proof Contexts
Clemens Ballarin
(2006)
0
comments
Cited
9
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 339-354
DOI:
10.1007/978-3-642-14052-5_24
SO-VID:
19d9b43b-125c-48f9-9aaf-4fdbbbd5df0d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 83
Extending Coq with Imperative Features and Its Application to SAT Verification
pp. 131
Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder
pp. 179
Fast LCF-Style Proof Reconstruction for Z3
pp. 243
A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture
pp. 291
Case-Analysis for Rippling and Inductive Proof
pp. 307
Importing HOL Light into Coq
pp. 339
The Isabelle Collections Framework
pp. 387
On the Formalization of the Lebesgue Integration Theory in HOL
pp. 403
From Total Store Order to Sequential Consistency: A Practical Reduction Theorem
Similar content
1,431
Craig's Interpolation Theorem formalised and mechanised in Isabelle/HOL
Authors:
Tom Ridge
Reconstructing veriT Proofs in Isabelle/HOL
Authors:
Mathias Fleury
,
Hans-Jörg Schurr
Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
Authors:
Alexander Schimpf
,
Stephan Merz
,
Jan-Georg Smaus
See all similar
Cited by
8
Automatic Data Refinement
Authors:
Peter Lammich
Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
Authors:
Peter Lammich
,
Thomas Tuerk
A Fully Verified Executable LTL Model Checker
Authors:
Javier Esparza
,
Peter Lammich
,
René Neumann
…
See all cited by