Results 51 to 60 of about 623,637 (299)
Labelings for Decreasing Diagrams [PDF]
, 2014 This article is concerned with automating the decreasing diagrams technique of van Oostrom for establishing confluence of term rewrite systems. We study abstract criteria that allow to lexicographically combine labelings to show local diagrams decreasing.
Felgenhauer, Bertram +2 more
core +2 more sources
Termination of rewrite relations on $\lambda$-terms based on Girard's notion of reducibility [PDF]
, 2015 In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on $\lambda$-terms,
Blanqui, Frédéric
core +4 more sources
Retrieve, Rerank and Rewrite: Soft Template Based Neural Summarization
Annual Meeting of the Association for Computational Linguistics, 2018 Most previous seq2seq summarization systems purely depend on the source text to generate summaries, which tends to work unstably. Inspired by the traditional template-based summarization approaches, this paper proposes to use existing summaries as soft ...
Ziqiang Cao +3 more
semanticscholar +1 more source
Compilation of combinatory reduction systems [PDF]
, 1993 Combinatory Reduction Systems generalise Term Rewriting Systems. They are powerful enough to express β-reduction of λ-calculus as a single rewrite rule. The additional expressive power has its price — CRSs are much harder to implement than ordinary TRSs.
Kahrs, Stefan
core +1 more source
Controlling Rewriting by Rewriting
Electronic 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.
Borovanský, Peter +2 more
openaire +1 more source
Productivity of Non-Orthogonal Term Rewrite Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Productivity is the property that finite prefixes of an infinite constructor term can be computed using a given term rewrite system. Hitherto, productivity has only been considered for orthogonal systems, where non-determinism is not allowed.
Matthias Raffelsieper
doaj +1 more source
Journal of Symbolic Computation, 1996 In this article we propose an extension of term rewriting techniques to automate the deduction in monotone pre-order theories. To prove an inclusionabfrom a given setIof them, we generate fromI, using a completion procedure, abi-rewrite system, that is, a pair of rewrite relations and , and seek a common termcsuch thatacandbc.
Levy, Jordi, Agustí, Jaume
openaire +3 more sources
Social media as a tool to rewrite the narrative for women in cardiothoracic surgery.
Interactive Cardiovascular and Thoracic Surgery, 2019 To deliver the best possible care, the global surgical workforce should mirror the diverse society it is entrusted to serve. Cardiothoracic surgery remains amongst the most under-represented of the surgical specialties for women.
N. Stamp +5 more
semanticscholar +1 more source
Explaining presupposition projection with dynamic semantics
Semantics and Pragmatics, 2011 Heim's (1982, 1983b) dynamic semantics provides an attractive system for capturing the basic facts about presupposition projection. A long-standing criticism of this semantics is that it requires for each connective lexical stipulations that are not ...
Daniel Rothschild
doaj +1 more source
Julia: A Fresh Approach to Numerical Computing [PDF]
SIAM Review, 2014 Bridging cultures that have often been distant, Julia combines expertise from the diverse fields of computer science and computational science to create a new approach to numerical computing.
Jeff Bezanson +3 more
semanticscholar +1 more source