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
35
views
10
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
2,362
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Interactive Theorem Proving
other
Editor(s):
Matt Kaufmann
,
Lawrence C. Paulson
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
Online interactive cancer simulations and demos
Most cited references
10
Record
: found
Abstract
: not found
Book Chapter
: not found
A Brief Overview of HOL4
Konrad Slind
,
Michael Norrish
(2008)
0
comments
Cited
35
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A machine-checked model for a Java-like language, virtual machine, and compiler
Gerwin Klein
,
Tobias Nipkow
(2006)
0
comments
Cited
32
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Comprehending monads
Philip Wadler
(1992)
0
comments
Cited
29
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 243-258
DOI:
10.1007/978-3-642-14052-5_18
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
2,362
AI isn’t science fiction: it’s digital design’s reality deep learning proves effective in designing crowns
Authors:
M. TRAN
Towards Automated Functional Equation Proving: A Benchmark Dataset and A Domain-Specific In-Context Agent
Authors:
Mahdi Buali
,
Robert Hoehndorf
Graph Representations for Higher-Order Logic and Theorem Proving
Authors:
Aditya Paliwal
,
Sarah Loos
,
Markus N. Rabe
…
See all similar