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
37
views
14
references
Top references
cited by
17
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,885
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theorem Proving in Higher Order Logics
Imperative Functional Programming with Isabelle/HOL
other
Author(s):
Lukas Bulwahn
,
Alexander Krauss
,
Florian Haftmann
,
Levent Erkök
,
John Matthews
Publication date
(Print):
2008
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
Smart Contracts Programming Languages
Most cited references
14
Record
: found
Abstract
: not found
Book
: not found
Isabelle/HOL
Tobias Nipkow
,
Markus Wenzel
,
Lawrence Paulson
(2002)
0
comments
Cited
199
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
Conference Proceedings
: not found
Imperative functional programming
Simon Peyton Jones
,
Philip Wadler
(1993)
0
comments
Cited
27
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2008
Pages
: 134-149
DOI:
10.1007/978-3-540-71067-7_14
SO-VID:
e3b03601-bdec-4e16-8de1-65fab47ff68c
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 86
Canonical Big Operators
pp. 134
Imperative Functional Programming with Isabelle/HOL
pp. 167
Secure Microkernels, State Monads and Scalable Refinement
pp. 230
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Similar content
2,885
A brief history of how reflexivity becomes imperative
Authors:
Margaret Archer
De-centering Neuronormativity is an Imperative in Humanistic Psychotherapy: Towards a Neurodiversity-Informed, Person-Centered Approach
Authors:
Matthew J. Bolton
Pytorch: an imperative style, high-performance deep learning library
Authors:
A. Paszke
,
HM Wallach
,
H. Larochelle
…
See all similar
Cited by
16
Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking
Authors:
Ashish Darbari
,
Bernd Fischer
,
Joao Marques-Silva
Building program construction and verification tools from algebraic principles
Authors:
Alasdair Armstrong
,
Victor Gomes
,
Georg Struth
Extending Coq with Imperative Features and Its Application to SAT Verification
Authors:
Michael Armand
,
Benjamin Grégoire
,
Arnaud Spiwack
…
See all cited by