The following pages link to A typed context calculus (Q5958759):
Displaying 18 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)
- Flow-sensitive type systems and the ambient calculus (Q1029816) (← links)
- The lambda-context calculus (extended version) (Q1044184) (← links)
- A lambda-calculus for dynamic binding (Q1127514) (← links)
- Nominal unification (Q1882909) (← links)
- A typed pattern calculus (Q1908354) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Types for the ambient calculus (Q2497144) (← links)
- (Q2763701) (← 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)
- (Q4791831) (← links)
- Two-level Lambda-calculus (Q4982628) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712432) (← links)
- A Core Calculus for Scala Type Checking (Q5756695) (← links)
- Implicit typing à la ML for the join-calculus (Q6044118) (← links)
- Processes, systems \& tests: defining contextual equivalences (Q6649539) (← links)
