The following pages link to (Q4938611):
Displaying 15 items.
- An initial algebra approach to term rewriting systems with variable binders (Q853743) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A domain model characterising strong normalisation (Q958484) (← links)
- A course in constructive algebra (Q1210701) (← links)
- Abstract data type systems (Q1391729) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Corrigendum to: ``Inductive-data-type systems'' (Q2309415) (← links)
- Constructive algebraic integration theory (Q2575777) (← links)
- Normal Higher-Order Termination (Q2946769) (← links)
- (Q3296117) (← links)
- Remarks on Isomorphisms of Simple Inductive Types (Q4924549) (← links)
- Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding (Q5058367) (← links)
- Calcular algebras (Q5219091) (← links)
- Inductively defined types in the Calculus of Constructions (Q5887516) (← links)
- Inductive-data-type systems (Q5958292) (← links)
