### Table 10: and and or rewrite rules

"... In PAGE 60: ... If none of the forms evaluate to true, the value of the last form is returned. The rewrite rules for or are given in Table10... ..."

### Table 1. The -Rewriting System

"... In PAGE 4: ...1 The -calculus The -calculus of explicit substitutions extends the -calculus with explicit operators to simulate the substitution (meta-)operation of the -calculus. The rewriting system of the -calculus is given in Table1 . Its syntax is given as follows: Types A ::= K j A ! A Contexts ::= nil j A Terms a ::= 1 j X j a a j A:a j a[s] where X 2 X Substitutions s ::= id j quot; j a s j s s The set of -terms is written as (X).... In PAGE 10: ... In particular the types of the terms inside the substitutions remain unchanged. Normalise: From Table1 we infer that terms are introduced inside substitutions only by applications of the rules (Beta) or (Abs). In both cases, the type of the term introduced in the substitution is equal to the type associated1 to the abstractor of the applied rule.... ..."

### Table 8: Expression rewriting

2002

"... In PAGE 8: ... The proof of this theorem relies on the following observations. Be- cause Rule (eq-sym) and Table8 allow us to pull renamings inside of if-then-else expressions, we may assume without loss of gener- ality, that expressions CT have form either AU, ARCG or CTBC BB DC BA CTBD, the case when AR is the identity function subsumes case CG. Also, let us consider possible expressions CT in a constraint of the form AY B5 CG BP CT where CG, amongst possibly other variables, oc- curs free in CT.... ..."

Cited by 8

### Table 1: Rewriting Rules

1994

Cited by 4

### Table 1: Rewriting Rules

1994

Cited by 4

### Table 1: Rewriting Rules

1994

Cited by 4