Join Our Newsletter

93 search results - page 1 / 19» The simply typed rewriting calculus |

ENTCS

2000

8 years 11 months ago
2000

The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...

FLOPS

2001

Springer

9 years 3 months ago
2001

Springer

We introduce a simply typed λ-calculus λκε which has both contexts and environments as ﬁrst-class values. In λκε, holes in contexts are represented by ordinary variables ...

FCT

2005

Springer

9 years 4 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

9 years 5 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 ...

WOLLIC

2009

Springer

9 years 5 months ago
2009

Springer

Abstract. We deﬁne a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This deﬁnition is based on ﬁnite mo...