Cut rules and explicit substitutions.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 131, doi. 10.1017/s0960129500003273
- By:
- Publication type:
- Article
Works matching IS 09601295 AND DT 2001 AND VI 11 AND IP 1
Results: 6
1
2
Dependent types and explicit substitutions: a meta-theoretical development.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 91, doi. 10.1017/s0960129500003261
- By:
- Publication type:
- Article
3
Pure type systems with explicit substitution.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 3, doi. 10.1017/s096012950000325x
- By:
- Publication type:
- Article
4
Perpetuality in a named lambda calculus with explicit substitutions.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 47, doi. 10.1017/s0960129500003248
- By:
- Publication type:
- Article
5
HOL-»Ã: an intentional first-order expression of higher-order logic.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 21, doi. 10.1017/s0960129500003236
- By:
- Publication type:
- Article
6
A »-calculus with explicit weakening and explicit substitution.
- Published in:
- Mathematical Structures in Computer Science, 2001, v. 11, n. 1, p. 169, doi. 10.1017/s0960129500003224
- By:
- Publication type:
- Article