Остановите войну!
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 38 matches
- 1991
- Stéphane Kaplan, Mitsuhiro Okada:
Conditional and Typed Rewriting Systems, 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990, Proceedings. Lecture Notes in Computer Science 516, Springer 1991, ISBN 3-540-54317-1 [contents] - 1990
- Gianni Aguzzi, U. Modigliani, M. Cecilia Verri:
An Universal Termination Condition for Solving Goals in Equational Languages. CTRS 1990: 418-423 - Hitoshi Aida, Joseph A. Goguen, José Meseguer:
Compiling Concurrent Rewriting onto the Rewrite Rule Machine. CTRS 1990: 320-332 - Roberto M. Amadio:
Typed Equivalence, Type Assignment, and Type Containment. CTRS 1990: 372-382 - Siva Anantharaman, Maria Paola Bonacina:
An Application of Automated Equational Reasoning to Many-valued Logic. CTRS 1990: 156-161 - Sergio Antoy:
Design Strategies for Rewrite Rules. CTRS 1990: 333-341 - Leo Bachmair, Harald Ganzinger:
Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). CTRS 1990: 162-180 - Franco Barbanera:
Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved. CTRS 1990: 260-271 - Hubert Bertling:
Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation. CTRS 1990: 181-193 - Eddy Bevers, Johan Lewi:
Proof by Consistency in Conditional Equational Theories. CTRS 1990: 194-205 - Maria Paola Bonacina, Jieh Hsiang:
Completion Procedures as Semidecision Procedures. CTRS 1990: 206-232 - Wadoud Bousdira, Jean-Luc Rémy:
On Sufficient Completeness of Conditional Specifications. CTRS 1990: 272-286 - François Bronsard, Uday S. Francois:
Conditional Rewriting in Focus. CTRS 1990: 2-13 - Hong Chen, Jieh Hsiang, Hwa-Chung Kong:
On Finite Representations of Infinite Sequences of Terms. CTRS 1990: 100-114 - Yiyun Chen, Michael J. O'Donnell:
Infinite Terms and Infinite Rewritings. CTRS 1990: 115-126 - Yiyun Chen, Michael J. O'Donnell:
Testing Confluence of Nonterminating Rewriting Systems. CTRS 1990: 127-136 - John Darlington, Yike Guo:
Constrained Equational Deduction. CTRS 1990: 424-435 - Nachum Dershowitz:
A Maximal-Literal Unit Strategy for Horn Clauses. CTRS 1990: 14-25 - Hervé Devie:
Linear Completion. CTRS 1990: 233-245 - Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, J. E. W. Smetsers:
Parallel Graph Rewriting on Loosely Coupled Machine Architectures. CTRS 1990: 354-369 - Martin C. Emele, Rémi Zajac:
A Fixed-Point Semantics for Feature Type Systems. CTRS 1990: 383-388 - Louis Galbiati, Carolyn L. Talcott:
A Simplifier for Untyped Lambda Expressions. CTRS 1990: 342-353 - Bernard R. Hodgson, Clement F. Kent:
A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems. CTRS 1990: 137-142 - Hélène Kirchner, Miki Hermann:
Meta-rule Synthesis from Crossed Rewrite Systems. CTRS 1990: 143-154 - Jan Willem Klop, Roel C. de Vrijer:
Extended Term Rewriting Systems. CTRS 1990: 26-50 - Emmanuel Kounalis, Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications. CTRS 1990: 51-63 - N. Lichtenstein, Stéphane Kaplan:
FPL: Functional Plus Logic Programming: An Integration of the FP and Prolog Languages. CTRS 1990: 287-294 - José Meseguer:
Conditional Rewriting Logic: Deduction, Models and Concurrency. CTRS 1990: 64-91 - Aart Middeldorp:
Confluence of the Disjoint Union of Conditional Term Rewriting Systems. CTRS 1990: 295-306 - Chilukuri K. Mohan:
Equivalences of Rewrite Programs. CTRS 1990: 92-97
skipping 8 more matches
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-06-19 07:02 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