The following pages link to Types for Proofs and Programs (Q5712302):
Displaying 13 items.
- Lambda calculus with patterns (Q930865) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- The simply typed rewriting calculus (Q2703689) (← links)
- The rewriting calculus. I (Q2720293) (← links)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN (Q2782483) (← links)
- The polymorphic rewriting-calculus [type checking vs. type inference] (Q2849860) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- Term collections in {\(\lambda\)} and {\(\rho\)}-calculi (Q2864209) (← links)
- From functional programs to interaction nets via the rewriting calculus (Q2864528) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- Distributive \(\rho\)-calculus (Q2873778) (← links)
- (Q4249892) (← links)
- System F i (Q5300891) (← links)