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
34
views
8
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,629
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theorem Proving in Higher Order Logics
Combining Testing and Proving in Dependent Type Theory
other
Author(s):
Peter Dybjer
,
Qiao Haiyan
,
Makoto Takeyama
Publication date
(Print):
2003
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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
8
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Dependent types in practical programming
Frank Pfenning
,
Hongwei Xi
(1999)
0
comments
Cited
40
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Constructive Mathematics and Computer Programming
Per Martin-Löf
(1982)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Generic Programming
Roland Backhouse
,
Patrik Jansson
,
Johan Jeuring
…
(1999)
0
comments
Cited
17
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 188-203
DOI:
10.1007/10930755_12
SO-VID:
50d12898-cd10-4083-bc36-c42c6f3d30e0
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Click’n Prove: Interactive Proofs within Set Theory
pp. 25
Formal Specification and Verification of ARM6
pp. 188
Combining Testing and Proving in Dependent Type Theory
pp. 270
Implementing Modules in the Coq System
pp. 287
MetaPRL – A Modular Logical Environment
Similar content
1,629
Interferons in COVID-19: missed opportunities to prove efficacy in clinical phase III trials?
Authors:
Josef Brzoska
,
Harald von Eick
,
Manfred Hündgen
A treatise on the plague, designed to prove it contagious, from facts, collected during the author’s residence in Malta, when visited by that malady in 1813: with observations on its prevention, character and treatment: to which is annexed an appendix
Authors:
AB Faulkner
AI isn’t science fiction: it’s digital design’s reality deep learning proves effective in designing crowns
Authors:
M. TRAN
See all similar
Cited by
8
Automatic Proof and Disproof in Isabelle/HOL
Authors:
Jasmin Christian Blanchette
,
Lukas Bulwahn
,
Tobias Nipkow
Foundational Property-Based Testing
Authors:
Zoe Paraskevopoulou
,
Catalin Hritcu
,
Maxime Dénès
…
Your Proof Fails? Testing Helps to Find the Reason
Authors:
Guillaume Petiot
,
Nikolai Kosmatov
,
Bernard Botella
…
See all cited by