Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 22 matches
- 2004
- Takahito Aoto, Toshiyuki Yamada, Yoshihito Toyama:
Inductive Theorems for Higher-Order Rewriting. RTA 2004: 269-284 - Frédéric Blanqui:
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems. RTA 2004: 24-39 - Stefan Blom:
An Approximation Based Approach to Infinitary Lambda Calculi. RTA 2004: 221-232 - Julien Carme, Joachim Niehren, Marc Tommasi:
Querying Unranked Trees with Stepwise Tree Automata. RTA 2004: 105-118 - Evelyne Contejean:
A Certified AC Matching Algorithm. RTA 2004: 70-84 - Herman Geuvers, Rob Nederpelt:
Rewriting for Fitch Style Natural Deductions. RTA 2004: 134-154 - Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Automated Termination Proofs with AProVE. RTA 2004: 210-220 - Nao Hirokawa, Aart Middeldorp:
Dependency Pairs Revisited. RTA 2004: 249-268 - Neil D. Jones, Nina Bohr:
Termination Analysis of the Untyped lamba-Calculus. RTA 2004: 1-23 - Jeroen Ketema:
Böhm-Like Trees for Term Rewriting Systems. RTA 2004: 233-248 - Jordi Levy, Manfred Schmidt-Schauß, Mateu Villaret:
Monadic Second-Order Unification Is NP-Complete. RTA 2004: 55-69 - Sébastien Limet, Gernot Salzer:
Proving Properties of Term Rewrite Systems via Logic Programs. RTA 2004: 170-184 - Salvador Lucas:
mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. RTA 2004: 200-209 - Ian Mackie:
Efficient lambda-Evaluation with Interaction Nets. RTA 2004: 155-169 - Jacob Matthews, Robert Bruce Findler, Matthew Flatt, Matthias Felleisen:
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems. RTA 2004: 301-311 - Ichiro Mitsuhashi, Michio Oyamaguchi, Yoshikatsu Ohta, Toshiyuki Yamada:
The Joinability and Unification Problems for Confluent Semi-constructor TRSs. RTA 2004: 285-300 - Jakob Grue Simonsen:
On the Modularity of Confluence in Infinitary Term Rewriting. RTA 2004: 185-199 - Toshinori Takai:
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation. RTA 2004: 119-133 - Yoshihito Toyama:
Termination of S-Expression Rewriting Systems: Lexicographic Path Ordering for Higher-Order Terms. RTA 2004: 40-54 - Johannes Waldmann:
Matchbox: A Tool for Match-Bounded String Rewriting. RTA 2004: 85-94 - Hans Zantema:
TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104 - Vincent van Oostrom:
Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings. Lecture Notes in Computer Science 3091, Springer 2004, ISBN 3-540-22153-0 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-27 03:38 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint