The following pages link to Abstract data type systems (Q1391729):
Displaying 10 items.
- Expressing combinatory reduction systems derivations in the rewriting calculus (Q857913) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering (Q1275015) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Semantic foundations for generalized rewrite theories (Q2503334) (← links)
- (Q2851046) (← links)
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs (Q3172889) (← links)
- The Computability Path Ordering: The End of a Quest (Q3540166) (← links)
- Inductive-data-type systems (Q5958292) (← links)
