Sciweavers

    232 search results - page 22 / 47
    » Termination of linear bounded term rewriting systems
    Sort
    View
    PPDP
    2007
    Springer
    171views Programming Languages» more  PPDP 2007»
    Higher-order semantic labelling for inductive datatype systems
    14 years 1 months ago
    Higher-order semantic labelling for inductive datatype systems
    Download  www.cs.gunma-u.ac.jp
    We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
    Makoto Hamana
    claim paper
    Read More »
    PODS
    1991
    ACM
    131views Database» more  PODS 1991»
    Termination Detection in Logic Programs using Argument Sizes
    13 years 11 months ago
    Termination Detection in Logic Programs using Argument Sizes
    Download  users.soe.ucsc.edu
    d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
    Kirack Sohn, Allen Van Gelder
    claim paper
    Read More »
    LPAR
    2004
    Springer
    137views Automated Reasoning» more  LPAR 2004»
    The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
    14 years 1 months ago
    The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
    Download  cl-informatik.uibk.ac.at
    The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
    Jürgen Giesl, René Thiemann, Peter Sch...
    claim paper
    Read More »
    QEST
    2008
    IEEE
    145views Modeling and Simulation» more  QEST 2008»
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    14 years 2 months ago
    Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
    Download  www.era.lib.ed.ac.uk
    We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
    Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
    claim paper
    Read More »
    IEICET
    2007
    110views more  IEICET 2007»
    A Higher-Order Knuth-Bendix Procedure and Its Applications
    13 years 7 months ago
    A Higher-Order Knuth-Bendix Procedure and Its Applications
    Download  www.sakabe.nuie.nagoya-u.ac.jp
    The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
    Keiichirou Kusakari, Yuki Chiba
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.