Sciweavers

Share
39 search results - page 1 / 8
» Soundness of the simply typed lambda calculus in ACL2
Sort
View
ACL2
2006
ACM
9 years 2 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
FCT
2005
Springer
9 years 2 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
WOLLIC
2009
Springer
9 years 3 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
ENTCS
2008
101views more  ENTCS 2008»
8 years 8 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
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'...
Andreas Abel
ENTCS
2007
113views more  ENTCS 2007»
8 years 8 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
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
books