Sciweavers

Share
93 search results - page 1 / 19
» The simply typed rewriting calculus
Sort
View
ENTCS
2000
80views more  ENTCS 2000»
8 years 11 months ago
The simply typed rewriting calculus
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...
Horatiu Cirstea, Claude Kirchner
FLOPS
2001
Springer
9 years 3 months ago
A Simply Typed Context Calculus with First-Class Environments
We introduce a simply typed λ-calculus λκε which has both contexts and environments as first-class values. In λκε, holes in contexts are represented by ordinary variables ...
Masahiko Sato, Takafumi Sakurai, Yukiyoshi Kameyam...
FCT
2005
Springer
9 years 4 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
ACL2
2006
ACM
9 years 5 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
WOLLIC
2009
Springer
9 years 5 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
books