Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
38
views
11
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
394
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Rewriting Techniques and Applications
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
other
Author(s):
Christian Urban
,
Bozhi Zhu
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
De Gruyter Materials Science: Energy
Most cited references
11
Record
: found
Abstract
: not found
Book Chapter
: not found
Ideas and Results in Proof Theory
Dag Prawitz
(1971)
0
comments
Cited
47
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Alpha-structural recursion and induction
Andrew M. Pitts
(2006)
0
comments
Cited
17
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On equivalence and canonical forms in the LF type theory
Robert Harper
,
Frank Pfenning
(2005)
0
comments
Cited
13
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 409-424
DOI:
10.1007/978-3-540-70590-1_28
SO-VID:
8f5ceec7-a52f-42c4-a9b1-43d68dd01dc9
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Modular Termination of Basic Narrowing
pp. 17
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
pp. 32
Term-Graph Rewriting Via Explicit Paths
pp. 48
Finer Is Better: Abstraction Refinement for Rewriting Approximations
pp. 63
A Needed Rewriting Strategy for Data-Structures with Pointers
pp. 79
Effectively Checking the Finite Variant Property
pp. 94
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
pp. 110
Maximal Termination
pp. 126
Usable Rules for Context-Sensitive Rewrite Systems
pp. 142
Combining Equational Tree Automata over AC and ACI Theories
pp. 157
Closure of Hedge-Automata Languages by Hedge Rewriting
pp. 172
On Normalisation of Infinitary Combinatory Reduction Systems
pp. 187
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems
pp. 202
Arctic Termination ...Below Zero
pp. 217
Logics and Automata for Totally Ordered Trees
pp. 232
Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks
pp. 246
Nominal Unification from a Higher-Order Perspective
pp. 261
Functional-Logic Graph Parser Combinators
pp. 276
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
pp. 291
Tree Automata for Non-linear Arithmetic
pp. 306
Confluence by Decreasing Diagrams
pp. 321
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
pp. 336
Root-Labeling
pp. 351
Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
pp. 366
Deciding Innermost Loops
pp. 381
Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
pp. 392
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting
pp. 409
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
pp. 425
Reduction Under Substitution
pp. 441
Normalization of Infinite Terms
Similar content
394
The cuts hurt — here's proof
Authors:
Connor Johnston
Temporal Trends in Difficult and Failed Tracheal Intubation in a Regional Community Anesthetic Practice.
Authors:
Rebecca A Schroeder
,
Richard Pollard
,
Ishwori Dhakal
…
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Authors:
Marko Vukolić
See all similar
Cited by
1
General Bindings and Alpha-Equivalence in Nominal Isabelle
Authors:
Christian Urban
,
Cezary Kaliszyk
See all cited by