ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
24
views
16
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
4,233
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Rewriting Techniques and Applications
Functional-Logic Graph Parser Combinators
other
Author(s):
Steffen Mazanek
,
Mark Minas
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
Functional role of amyloid
Most cited references
16
Record
: found
Abstract
: not found
Article
: not found
Linear logic
Jean-Yves Girard
(1987)
0
comments
Cited
472
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Logic Programming in a Fragment of Intuitionistic Linear Logic
J.S. Hodas
,
D Miller
(1994)
0
comments
Cited
42
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A needed narrowing strategy
Rachid Echahed
,
Sergio Antoy
,
Michael Hanus
(2000)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 261-275
DOI:
10.1007/978-3-540-70590-1_18
SO-VID:
c91a6e34-d731-42fb-92e6-92c11abf0a92
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
4,233
INTEGRAÇÃO DE PREDICADOS NOMINAIS EM PARSER: UMA EXPERIÊNCIA COM AS CONSTRUÇÕES COM O VERBO-SUPORTE DAR EM PORTUGUÊS BRASILEIRO
Authors:
Amanda RASSI
,
Jorge Baptista
,
Oto VALE
…
Building discourse parser for Thirukkural.
Authors:
Large Language Models are Complex Table Parsers
Authors:
Bowen Zhao
,
Changkai Ji
,
Yuejie Zhang
…
See all similar
Cited by
1
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
Authors:
Steffen Mazanek
,
Sonja Maier
,
Mark Minas
See all cited by