Rewriting

Results: 653



#Item
21

Higher-Order Model Checking by Abstraction of Type Derivation Rewriting Takeshi Tsukada1,2 and Naoki Kobayashi3 1 Graduate School of Information Science, Tohoku University

Add to Reading List

Source URL: www-kb.is.s.u-tokyo.ac.jp

Language: English - Date: 2016-04-18 06:57:45
    22

    Effective Query Rewriting with Ontologies over DBoxes

    Add to Reading List

    Source URL: www.inf.unibz.it

    Language: English - Date: 2017-01-27 04:48:10
      23

      Rewriting Flash Memories by Message Passing Eyal En Gad, Wentao Huang, Yue Li and Jehoshua Bruck California Institute of Technology, Pasadena, CA 91125 {eengad,whuang,yli,bruck}@caltech.edu I. I NTRODUCTION

      Add to Reading List

      Source URL: paradise.caltech.edu

      Language: English - Date: 2015-02-08 06:00:08
        24Software engineering / Computing / Computer programming / Functional languages / Control flow / High-level programming languages / Programming language comparisons / Programming language syntax / Eval / JavaScript / Scope / Dynamic programming language

        Isolating JavaScript with Filters, Rewriting, and Wrappers Sergio Maffeis1 , John C. Mitchell2 , and Ankur Taly2 1 Imperial College London

        Add to Reading List

        Source URL: wwwhomes.doc.ic.ac.uk

        Language: English - Date: 2009-08-14 07:09:04
        25

        Rewriting Flash Memories by Message Passing Eyal En Gad, Wentao Huang, Yue Li and Jehoshua Bruck California Institute of Technology, Pasadena, CA 91125 {eengad,whuang,yli,bruck}@caltech.edu I. I NTRODUCTION

        Add to Reading List

        Source URL: www.paradise.caltech.edu

        Language: English - Date: 2015-02-08 06:00:08
          26

          In-place Graph Rewriting with Interaction Nets Ian Mackie Shinya Sato An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute

          Add to Reading List

          Source URL: www.ianmackie.com

          Language: English - Date: 2018-02-23 17:17:29
            27

            A Term Rewriting System for Kuratowski’s Closure-Complement Problem∗ Osama Al-Hassani1 , Quratul-ain Mahesar1 , Claudio Sacerdoti Coen2 , and Volker Sorge1 1

            Add to Reading List

            Source URL: www.cs.unibo.it

            - Date: 2012-05-15 04:30:46
              28

              Tree Automata for Reachability in Rewriting Thomas Genet http://people.irisa.fr/Thomas.Genet/ IRISA, Universit´e de Rennes 1 1

              Add to Reading List

              Source URL: www.win.tue.nl

              - Date: 2017-02-02 02:41:59
                29

                A Visual Environment for Developing Context-Sensitive Term Rewriting Systems Jacob Matthews1 , Robert Bruce Findler1 , Matthew Flatt2 , and Matthias Felleisen3 1 University of Chicago {jacobm, robby}@cs.uchicago.edu

                Add to Reading List

                Source URL: www.cs.utah.edu

                - Date: 2004-04-04 22:29:30
                  30

                  Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction Shinnosuke Mizutani Naoki Nishida

                  Add to Reading List

                  Source URL: www.cs.ox.ac.uk

                  - Date: 2017-09-09 06:01:35
                    UPDATE