Sciweavers

    8 search results - page 1 / 2
    » A Formalization of Strong Normalization for Simply-Typed Lam...
    Sort
    View
    ENTCS
    2007
    113views more  ENTCS 2007»
    A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
    13 years 4 months ago
    A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
    Download  www.cs.bu.edu
    We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
    Kevin Donnelly, Hongwei Xi
    claim paper
    Read More »
    ENTCS
    2002
    129views more  ENTCS 2002»
    Eliminating Proofs from Programs
    13 years 4 months ago
    Eliminating Proofs from Programs
    Download  www.cs.cmu.edu
    This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
    Femke van Raamsdonk, Paula Severi
    claim paper
    Read More »
    POPL
    2004
    ACM
    141views Programming Languages» more  POPL 2004»
    Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
    14 years 4 months ago
    Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
    Download  www.cl.cam.ac.uk
    We present a notion of -long ? -normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in norm...
    Vincent Balat, Roberto Di Cosmo, Marcelo P. Fiore
    claim paper
    Read More »
    TOCL
    2012
    235views Formal Methods» more  TOCL 2012»
    Topological and Simplicial Models of Identity Types
    11 years 6 months ago
    Topological and Simplicial Models of Identity Types
    Download  tocl.acm.org
    racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
    Benno van den Berg, Richard Garner
    claim paper
    Read More »
    TLCA
    1993
    Springer
    113views Theoretical Computer Science» more  TLCA 1993»
    A Formalization of the Strong Normalization Proof for System F in LEGO
    13 years 8 months ago
    A Formalization of the Strong Normalization Proof for System F in LEGO
    Download  www.cs.nott.ac.uk
    Thorsten Altenkirch
    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.