19 search results - page 1 / 4 » Recognizability in the Simply Typed Lambda-Calculus |
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
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...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
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...
ACL2
2006
ACM
13 years 10 months ago
2006
ACM
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 ...
ENTCS
2008
13 years 4 months ago
2008
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'...
ENTCS
2007
13 years 4 months ago
2007
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...