The following pages link to Pure patterns type systems (Q2942930):
Displaying 18 items.
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Lambda calculus with patterns (Q930865) (← links)
- On the confluence of lambda-calculus with conditional rewriting (Q987976) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- A typed pattern calculus (Q1908354) (← links)
- Abstract canonical presentations (Q2500482) (← links)
- Semantic foundations for generalized rewrite theories (Q2503334) (← links)
- Rewriting calculus with(out) types (Q2851046) (← links)
- A framework for defining logical frameworks (Q2864157) (← links)
- Term collections in {\(\lambda\)} and {\(\rho\)}-calculi (Q2864209) (← links)
- From functional programs to interaction nets via the rewriting calculus (Q2864528) (← links)
- Imperative LF meta-programming (Q2871844) (← links)
- Towards a sharing strategy for the graph rewriting calculus (Q2873680) (← links)
- First-class patterns (Q3616447) (← links)
- A Polymorphic Type System for the Lambda-Calculus with Constructors (Q3637198) (← links)
- Domain-free pure type systems (Q4762953) (← links)
- Narrowing Based Inductive Proof Search (Q4916079) (← links)
