Sciweavers

    TLCA
    2007
    Springer
    115views Theoretical Computer Science» more  TLCA 2007»
    An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
    15 years 8 days ago
    An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
    Download  www.sato.kuis.kyoto-u.ac.jp
    Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
    Koji Nakazawa
    claim paper
    Read More »
    RTA
    2007
    Springer
    105views Theoretical Computer Science» more  RTA 2007»
    Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
    15 years 8 days ago
    Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi
    Download  www.nue.riec.tohoku.ac.jp
    We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
    Kentaro Kikuchi
    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.