The following pages link to (Q2778872):
Displaying 16 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 power margins (Q1120006) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- Type soundness for path polymorphism (Q1744425) (← links)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN (Q2782483) (← 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)
- Distributive \(\rho\)-calculus (Q2873778) (← links)
- (Q5497125) (← links)
- Theory of Power Matching (Q5872941) (← links)
- Implementing the \(\lambda_{GT}\) language: a functional language with graphs as first-class data (Q6535521) (← links)
