Sciweavers

    IPL
    2007
    78views more  IPL 2007»
    Ensuring the quasi-termination of needed narrowing computations
    14 years 22 days ago
    Ensuring the quasi-termination of needed narrowing computations
    Download  users.dsic.upv.es
    We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
    J. Guadalupe Ramos, Josep Silva, Germán Vid...
    claim paper
    Read More »
    CORR
    2007
    Springer
    82views Education» more  CORR 2007»
    Programs as polygraphs: computability and complexity
    14 years 24 days ago
    Programs as polygraphs: computability and complexity
    Download  www.loria.fr
    Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
    Guillaume Bonfante, Yves Guiraud
    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-2025, USA.