## 0 := t 1 ' s 1 ^ ^ t n ' s n . 4. t=x := ft=xg ?x , where ?x is with a possible binding for x deleted, i.e. t=x is the extension of ft=xg by

- 0 := t 1 ' s 1 ^ ^ t n ' s n . 4. t=x := ft=xg ?x…

On theories with a combinatorial deenition of \equivalence". We have addressed some defects of the partial calculus p as a constructive framework for partial functions, and we have proposed a modiication p of p by explicit substitutions. The system p is embeddable into partial combinatory logic CL p and therefore inherits all the models of the latter. We… (More)

- Explicit substitution
- Combinatory logic
- Applicative programming language
- Substitution (logic)
- Theory
- Abstract rewriting system
- Explicit and implicit methods
- Rewriting
- Programming Languages
- Functional programming
- Calculus of constructions
- Point of View (computer hardware company)
- Programming language
- Recursion
- notation
- James A. Kahle
- Calculi

Sorry, we couldn't extract any figures or tables for this paper.