Normalization for the Simply-Typed Lambda-Calculus in Twelf | Zendy

Andreas Abel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Normalization for the Simply-Typed Lambda-Calculus in Twelf

Author(s) -

Andreas Abel

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.11.009

Subject(s) - normalization (sociology) , simply typed lambda calculus , usable , typed lambda calculus , calculus (dental) , system f , lambda calculus , computability , church encoding , computer science , natural deduction , programming language , algorithm , mathematics , medicine , dentistry , sociology , anthropology , world wide web

Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a syntactical proof is adapted and formalized instead. In this case study, some boundaries of Twelf current capabilities are touched and discussed

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research