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
54
views
25
references
Top references
cited by
31
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,125
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Frontiers of Combining Systems
Proving and Disproving Termination of Higher-Order Functions
other
Author(s):
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
Publication date
(Print):
2005
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
Higher order chromatin architecture
Most cited references
25
Record
: found
Abstract
: not found
Article
: not found
Termination of rewriting
Nachum Dershowitz
(1987)
0
comments
Cited
65
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
(2005)
0
comments
Cited
33
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Termination Proofs with AProVE
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
…
(2004)
0
comments
Cited
27
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 216-231
DOI:
10.1007/11559306_12
SO-VID:
d02cbe75-1cd7-406f-8859-21ddefde9b5c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 310
ATS: A Language That Combines Programming with Theorem Proving
pp. 48
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic
pp. 81
Sociable Interfaces
pp. 168
An Efficient Decision Procedure for UTVPI Constraints
pp. 216
Proving and Disproving Termination of Higher-Order Functions
Similar content
5,125
Modeling rat with weiqi deficiency syndrome and disproving effect of yupingfeng san
Authors:
L Jia
,
Y. WANG
,
M. Zhang
EZ Rider disproves notion that intermodal damages freight
Authors:
D Morra
Automatically disproving fair termination of higher-order functional programs
Authors:
Keiichi Watanabe
,
Ryosuke Sato
,
Takeshi Tsukada
…
See all similar
Cited by
31
AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
Authors:
Jürgen Giesl
,
Peter Schneider-Kamp
,
René Thiemann
Mechanizing and Improving Dependency Pairs
Authors:
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
…
Analyzing Program Termination and Complexity Automatically with AProVE
Authors:
Jürgen Giesl
,
Cornelius Aschermann
,
Marc Brockschmidt
…
See all cited by