Filters








348 Hits in 5.9 sec

Page 8925 of Mathematical Reviews Vol. , Issue 2003m [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Church-Rosser property of a simple reduction for full first-order classical natural deduction. (English summary) Ann. Pure Appl. Logic 119 (2003), no. 1-3, 225-237.  ...  This paper gives a direct proof of the Church-Rosser property of the cut-elimination procedure for full first-order classical natural deduction.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-12_2003m/page/8925" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-12_2003m/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Strong Normalization of Classical Natural Deduction with Disjunction [chapter]

Philippe de Groote
<span title="">2001</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula  ...  property.  ...  Confluence of the reductions We prove the Church-Rosser property by establishing the local confluence of the reductions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45413-6_17">doi:10.1007/3-540-45413-6_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lek4kcgxtbhnxk56ehzxbe5sze">fatcat:lek4kcgxtbhnxk56ehzxbe5sze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401111701/http://www.loria.fr/~degroote/papers/tlca01.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bc/3c/bc3c636e3b92073f21456c01421830e7d4f3fc7b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45413-6_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Proof Theoretical Account of Continuation Passing Style [chapter]

Ichiro Ogata
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The CBV normalization procedure for Classical Natural Deduction (CND)[17] is shown to be simulated by the q-protocol. First, we define a translation from λµ v to λµ let .  ...  Moreover, with the help of this refinement, we also get simple, intuitive proof of the CR-property by using standard parallel reduction method [25] .  ...  See appendix A for the full proof of CR-property for our λµ v .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45793-3_33">doi:10.1007/3-540-45793-3_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vckx2etkdrb55m6sbj37wgu3gm">fatcat:vckx2etkdrb55m6sbj37wgu3gm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190227100511/http://pdfs.semanticscholar.org/8d3a/a7477e670de37403dbaaee63e5a40aa3d2b4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/3a/8d3aa7477e670de37403dbaaee63e5a40aa3d2b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-45793-3_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A CPS-Transform of Constructive Classical Logic [chapter]

Ichiro Ogata
<span title="">1999</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The Strongly Normalizable(SN) and Church-Rosser(CR) property of n is shown to be a consequence of SN and CR property of the tq-protocol.  ...  The -calculus, viewed as a reduction system, is also SN and CR [15] . Otherwise said, CND is also a constructive classical logic in natural deduction style.  ...  It is dened on a natural deduction-style logic, called Classical Natural Deduction (CND). Sequents of CND is similar to that of LK. The only dierence is, it has exactly one unindexed formula in rhs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46674-6_23">doi:10.1007/3-540-46674-6_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e4g7ibzw4jdtxmfowqh655ozby">fatcat:e4g7ibzw4jdtxmfowqh655ozby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226120425/http://pdfs.semanticscholar.org/710a/ed3b48825cdfb221e94b3ef681a64a6b4f90.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/0a/710aed3b48825cdfb221e94b3ef681a64a6b4f90.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46674-6_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The term rewriting approach to automated theorem proving

Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
There are essentially two types of reduction orderings on terms for proving termination. The first one, called syntactical, provides the ordering via a careful analysis of the structure of the terms.  ...  For such a purpose, two common, well-ordered sets are the natural numbers and the terms ordered by a syntactical ordering.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(92)90047-7">doi:10.1016/0743-1066(92)90047-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3epxkyjsvzgyno5j547g5qczs4">fatcat:3epxkyjsvzgyno5j547g5qczs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170928162250/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/696/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wNzQzMTA2NjkyOTAwNDc3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/d5/bbd59bd94b23ce195301125f0e36e69b07c7cd25.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(92)90047-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Equational Logic and Rewriting [chapter]

Claude Kirchner, Hélène Kirchner
<span title="">2014</span> <i title="Elsevier"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3htcvojut5de5ct6zf42o424vi" style="color: black;">Handbook of the History of Logic</a> </i> &nbsp;
First, for equational theories enjoying a Church-Rosser property, rewriting provides a (semi-)decision procedure.  ...  This amounts to work with the notion of ordered rewriting previously defined and to adapt the Church-Rosser property [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-0-444-51624-4.50006-x">doi:10.1016/b978-0-444-51624-4.50006-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eqtvr66m65eula7otl7fr6ppaa">fatcat:eqtvr66m65eula7otl7fr6ppaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430174838/https://hal.inria.fr/hal-01183817/file/eqLogicRw.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/be/0cbe44fc89b21bdfb2984c3d770540d1fabc436f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/b978-0-444-51624-4.50006-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Theorem Proving and Algebra [article]

Joseph A. Goguen
<span title="2021-01-16">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
models, abstract data types, initiality, and induction; rewriting and deduction modulo equations; first-order logic, models, and proof planning; second-order algebra; order-sorted algebra and rewriting  ...  The book considers several different logical systems, including first-order logic, Horn clause logic, equational logic, and first-order logic with equality.  ...  Proof: (1) and (2) imply that A is locally Church-Rosser, and then the Newman Lemma gives the full Church-Rosser property.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.02690v2">arXiv:2101.02690v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2unv7ebr7zdprpjrcme5pmgkvi">fatcat:2unv7ebr7zdprpjrcme5pmgkvi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210121031047/https://arxiv.org/ftp/arxiv/papers/2101/2101.02690.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.02690v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Natural deduction systems for some non-commutative logics

Norihiro Kamide, Motohiko Mouri
<span title="2007-08-25">2007</span> <i title="Uniwersytet Mikolaja Kopernika/Nicolaus Copernicus University"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cqchsjbcrzesbc3b7elv2aorpy" style="color: black;">Logic and Logical Philosophy</a> </i> &nbsp;
Varieties of natural deduction systems are introduced for Wansing's paraconsistent non-commutative substructural logic, called a constructive sequential propositional logic (COSPL), and its fragments.  ...  Normalization, strong normalization and Church-Rosser theorems are proved for these systems.  ...  Heinrich Wansing for his valuable comments and careful reading on a previous version of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2007.005">doi:10.12775/llp.2007.005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5zxtkufnhzgfhc6v4wo6vbyxvy">fatcat:5zxtkufnhzgfhc6v4wo6vbyxvy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150522104143/http://apcz.pl/czasopisma/index.php/LLP/article/download/LLP.2007.005/1470" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/ea/3dea8f03942617deaae1e5a3e0cc6fa2117f1c56.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.12775/llp.2007.005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A framework for defining logics

Robert Harper, Furio Honsell, Gordon Plotkin
<span title="1993-01-02">1993</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
There are a great many logics of interest for computer science (for example, equational, first-order, higherorder, modal, temporal, relevant, and linear logics, type-theories and set theories, type assignment  ...  This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and  ...  Taking a different approach, Coquand has also given a proof of the Church-Rosser property for a very similar type system [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/138027.138060">doi:10.1145/138027.138060</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xht7p7hyyjh4hpzuvfuycskwje">fatcat:xht7p7hyyjh4hpzuvfuycskwje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814042839/https://www.era.lib.ed.ac.uk/bitstream/handle/1842/202/Framework_Def_Log.pdf?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/50/ac/50ace69f632e2a645755cf5675524f0cb5b18007.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/138027.138060"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Formulae-as-Types Interpretation of Subtractive Logic

T. Crolard
<span title="2004-08-01">2004</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/crzmi3qeiramtlvcrfycib3qg4" style="color: black;">Journal of Logic and Computation</a> </i> &nbsp;
This presentation is two-fold: we first define a very natural restriction of the λµ-calculus which is closed under reduction and whose type system is a constructive restriction of the Classical Natural  ...  From a computational standpoint, the resulting calculus provides a type system for first-class coroutines (a restricted form of first-class continuations). Lemma 6.11.  ...  A.1.6 Church-Rosser property of the λµ →+×⊗⊥ -calculus The Church-Rosser property follows from the local confluence of the reductions, the strong normalization and Newman lemma.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/14.4.529">doi:10.1093/logcom/14.4.529</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tjyiakbzlvblxnggrksoeciszi">fatcat:tjyiakbzlvblxnggrksoeciszi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808125803/http://cedric.cnam.fr/cpr/crolard/publications/jlc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/43/5c4363af97178d0ed468b6dc83b377a4f874fde6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/logcom/14.4.529"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

Lecture notes on the lambda calculus [article]

Peter Selinger
<span title="2013-12-26">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007 and 2013.  ...  Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization  ...  In this case, the Church-Rosser property holds even for βη-reduction. Exercise 31.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0804.3434v2">arXiv:0804.3434v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4pubrmtokjfldcs4autyp5k6ty">fatcat:4pubrmtokjfldcs4autyp5k6ty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200829182859/https://arxiv.org/pdf/0804.3434v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/f2/84f2de1557eb3610817d550d5da0f1b08540d3df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0804.3434v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The stack calculus

Alberto Carraro, Thomas Ehrhard, Antonino Salibra
<span title="2013-03-28">2013</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
Its type system enforces strong normalization of expressions and it is a sound and complete system for full implicational Classical Logic.  ...  We give a very simple denotational semantics which allows easy calculations of the interpretation of expressions.  ...  The typed fragment is a sound and complete system for full implicational Classical Logic. The type system that Lafont et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.113.10">doi:10.4204/eptcs.113.10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kv2q2eb2w5chhhj345r6rlmpum">fatcat:kv2q2eb2w5chhhj345r6rlmpum</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810053935/http://www.dsi.unive.it/~acarraro/CES12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/6d/d46d203bb0820e9cbc12e2064996d91be3e1211a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.113.10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Verifiable Certificates for Predicate Subtyping [chapter]

Frederic Gilbert
<span title="">2019</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The use of this reduction instead of the more standard reduction → βσ allows to establish a simple correspondence between PVS-Core and PVS-Cert.  ...  The assignment of types remains very simple: in particular, type-checking is decidable in higher-order logic.  ...  Properties of PVS-Cert One of the most important properties satisfied by PVS-Cert is the Church-Rosser property. Theorem 1 (Church-Rosser for → β * ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-17184-1_16">doi:10.1007/978-3-030-17184-1_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/elvng7y4ojbe5a7cxnzvgde3zm">fatcat:elvng7y4ojbe5a7cxnzvgde3zm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503195703/https://link.springer.com/content/pdf/10.1007%2F978-3-030-17184-1_16.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/45/5b/455b4e5a4ca9465b1dc1c99d97daaa3c42139b71.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-17184-1_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Structures for Abstract Rewriting

Marc Aiguier, Diane Bahrami
<span title="2007-01-25">2007</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a> </i> &nbsp;
To achieve this purpose, we provide a few simple conditions (or axioms) under which rewriting (and then the set of classical properties and methods) can be modeled, understood, studied, proven and generalized  ...  When rewriting is used to generate convergent and complete rewrite systems in order to answer the validity problem for some theories, all the rewriting theories rely on a same set of notions, properties  ...  We also thank the three reviewers for their careful reading of this text and helpful comments.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-006-9065-7">doi:10.1007/s10817-006-9065-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xqjib73s35efdcz3aq2hhgmvle">fatcat:xqjib73s35efdcz3aq2hhgmvle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190505185854/https://hal.archives-ouvertes.fr/hal-00341965/file/jar07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/a1/3ea1dddacb66e7b4ccfabc33d3032cbb024a7f1f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-006-9065-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Conditional rewriting logic as a unified model of concurrency

José Meseguer
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency.  ...  Maude provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems.  ...  , the Church-Rosser property is historically associated with this model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90182-f">doi:10.1016/0304-3975(92)90182-f</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sqyjuly6rzambma4e6zmomrogm">fatcat:sqyjuly6rzambma4e6zmomrogm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307221825/https://core.ac.uk/download/pdf/81931677.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/35/79/3579bbeebbd210005853871d828b106c98e8ea65.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(92)90182-f"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 348 results