Pages that link to "Item:Q4645800"
From MaRDI portal
The following pages link to Higher-Order Algebra, Logic, and Term Rewriting (Q4645800):
Displayed 15 items.
- Term graph rewriting (Q4645801) (← links)
- Approximation and normalization results for typeable term rewriting systems (Q4645802) (← links)
- Modular properties of algebraic type systems (Q4645803) (← links)
- Collapsing partial combinatory algebras (Q4645804) (← links)
- A complete proof system for Nested Term Graphs (Q4645805) (← links)
- R n - and G n -logics (Q4645806) (← links)
- The variable containment problem (Q4645807) (← links)
- Higher-order equational logic for specification, simulation and testing (Q4645808) (← links)
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving (Q4645809) (← links)
- Assertions and recursions (Q4645810) (← links)
- Development closed critical pairs (Q4645811) (← links)
- Two different strong normalization proofs? (Q4645812) (← links)
- Third-order matching in the polymorphic lambda calculus (Q4645813) (← links)
- Higher-order algebra with transfinite types (Q4645814) (← links)
- Abstraction of hardware construction (Q4645815) (← links)