Scribd Logo
Upload

Welcome to Scribd!

  • Y-Combinator STLC Typing Derivation Error.

    Uploaded by

    enoksrd
    1 views1 page
    This document demonstrates type inference rules being applied to derive that the expression (λf:A→A.(λx:A.f(xx)))(λx:A.f(xx)) has type ↑. It uses axioms and inference rules like →I and →E to show that f:A→A, x:A proves x:A, f(xx):↑, and λx:A.f(xx) has type A→↑, allowing the final expression to be given type ↑.

    Original Description:

    A failed typing derivation for the Y-combinator in the simply typed lambda calculus.

    Original Title

    Y-combinator STLC typing derivation error.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document demonstrates type inference rules being applied to derive that the expression (λf:A→A.(λx:A.f(xx)))(λx:A.f(xx)) has type ↑. It uses axioms and inference rules like →I and →E to show that f:A→A, x:A proves x:A, f(xx):↑, and λx:A.f(xx) has type A→↑, allowing the final expression to be given type ↑.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    1 views1 page

    Y-Combinator STLC Typing Derivation Error.

    Uploaded by

    enoksrd
    This document demonstrates type inference rules being applied to derive that the expression (λf:A→A.(λx:A.f(xx)))(λx:A.f(xx)) has type ↑. It uses axioms and inference rules like →I and →E to show that f:A→A, x:A proves x:A, f(xx):↑, and λx:A.f(xx) has type A→↑, allowing the final expression to be given type ↑.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    f :AA, x:A ` x : A

    f :AA, x:A ` f : AA

    AXIOM

    f :AA, x:A ` x : A

    AXIOM

    f :AA, x:A ` x : A

    f :AA, x:A ` f : AA

    f :AA, x:A ` f (xx) :


    f :AA ` x:A.f (xx) :

    AXIOM

    f :AA, x:A ` xx : !

    AXIOM

    f :AA ` x:A.f (xx) :

    ` f :AA.(x:A.f (xx))(x:A.f (xx)) :

    I
    E

    f :AA ` (x:A.f (xx))(x:A.f (xx)) :


    I

    f :AA, x:A ` x : A

    AXIOM
    E

    f :AA, x:A ` f (xx) :

    AXIOM

    f :AA, x:A ` xx : !

    You might also like