The following pages link to A typed context calculus (Q5958759):
Displaying 9 items.
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms (Q964000) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- A lambda-calculus for dynamic binding (Q1127514) (← links)
- Nominal unification (Q1882909) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions (Q2866332) (← links)
- Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction (Q3520166) (← links)
- Two-level Lambda-calculus (Q4982628) (← links)
