COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
From MaRDI portal
Publication:3358239
Recommendations
Cited in
(19)- More problems in rewriting
- Modularity of termination and confluence in combinations of rewrite systems with \(\lambda_\omega\)
- Addressed term rewriting systems: application to a typed object calculus
- Normal forms in combinatory logic
- scientific article; zbMATH DE number 512772 (Why is no real title available?)
- Intersection type assignment systems with higher-order algebraic rewriting
- scientific article; zbMATH DE number 4124996 (Why is no real title available?)
- An insertion operator preserving infinite reduction sequences
- scientific article; zbMATH DE number 51605 (Why is no real title available?)
- Confluence of the lambda calculus with left-linear algebraic rewriting
- Approximation and normalization results for typeable term rewriting systems
- Problems in rewriting III
- Variants of the basic calculus of constructions
- Combining type disciplines
- Congruence types
- Rewriting with extensional polymorphic \(\lambda \)-calculus
- Lambda-definable term rewriting systems
- On the power of simple diagrams
- On modular properties of higher order extensional lambda calculi
This page was built for publication: COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3358239)