Results 11 to 20 of about 15,524 (267)

Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
doaj   +1 more source

Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG).
Manfred Schmidt-Schauss
doaj   +1 more source

Rewrite, rewrite, rewrite, rewrite, rewrite...

open access: yesProceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989
The theory of term rewriting systems has important applications in abstract data type specifications and functional programming languages. We begin here a study of properties of systems that are not necessarily terminating, but allow for infinite derivations that have a limit.
Nachum Dershowitz, Stéphane Kaplan
openaire   +2 more sources

Rewrite, rewrite, rewrite, rewrite, rewrite, …

open access: yesTheoretical Computer Science, 1991
We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.
Nachum Dershowitz   +2 more
openaire   +1 more source

Modularity of Convergence and Strong Convergence in Infinitary Rewriting [PDF]

open access: yesLogical Methods in Computer Science, 2010
Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures.
Stefan Michael Kahrs
doaj   +1 more source

Controlling Rewriting by Rewriting

open access: yesElectronic Notes in Theoretical Computer Science, 1996
AbstractIn this paper, we investigate the idea of controlling rewriting by strategies and we develop a strategy language whose operational semantics is also based on rewriting. This language is described in ELAN, a language based on computational systems that are simply rewriting theories controlled by strategies.
Peter Borovanský   +2 more
openaire   +1 more source

RNA-Editing with Combined Insertion and Deletion Preserves Regularity [PDF]

open access: yesScientific Annals of Computer Science, 2013
We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the match with a given set of auxiliary strings, called guides. Guided insertion/deletion considers
E.P. de Vink, H. Zantema, D. Bošnački
doaj   +1 more source

Term Graph Rewriting and Parallel Term Rewriting [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj   +1 more source

The Effect of Operating Temperature on the Response Time of Optically Driven Liquid Crystal Displays

open access: yesCrystals, 2020
Optically driven liquid crystal displays (ODLCDs) realizes their display function by tuning the easy axis of liquid crystal (LC) molecules under polarized blue light, which has been utilized in some optical devices due to its advantages of ultra-low ...
Vladimir Chigrinov   +4 more
doaj   +1 more source

Towards 3-Dimensional Rewriting Theory [PDF]

open access: yesLogical Methods in Computer Science, 2014
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer.
Samuel Mimram
doaj   +1 more source

Home - About - Disclaimer - Privacy