Pages that link to "Item:Q2703689"
From MaRDI portal
The following pages link to The simply typed rewriting calculus (Q2703689):
Displaying 10 items.
- Uncurrying for termination and complexity (Q352959) (← links)
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- Simply-typed underdeterminism (Q1273067) (← links)
- ELAN from a rewriting logic point of view (Q1608914) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- (Q2763701) (← links)
- From Rogue to MicroRogue (Q2849859) (← links)
- The polymorphic rewriting-calculus [type checking vs. type inference] (Q2849860) (← links)
- (Q3138540) (← links)
- iRho: an imperative rewriting calculus (Q3520144) (← links)