Sciweavers

    TGC
    2007
    Springer
    169views Applied Computing» more  TGC 2007»
    On the Complexity of Termination Inference for Processes
    14 years 5 months ago
    On the Complexity of Termination Inference for Processes
    Download  rap.dsi.unifi.it
    We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
    Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
    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.