scientific article; zbMATH DE number 512772
From MaRDI portal
Publication:4281465
Recommendations
- COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
- Intersection type assignment systems with higher-order algebraic rewriting
- Higher-order rewrite systems and their confluence
- Implementing first-order rewriting with constructor systems
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Conjunctive Type Systems and Abstract Interpretation of Higher-order Functional Programs
- Pure type systems in rewriting logic: specifying typed higher-order languages in a first-order logical framework
- Rewrite systems on a lattice of types
- A higher-order implementation of rewriting
Cited in
(13)- Normalization results for typeable rewrite systems
- Abstract data type systems
- Variants of the basic calculus of constructions
- Pushing the frontiers of combining rewrite systems farther outwards
- COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS
- Modularity of termination and confluence in combinations of rewrite systems with _
- Modular properties of algebraic type systems
- scientific article; zbMATH DE number 883895 (Why is no real title available?)
- More problems in rewriting
- (Head-)normalization of typeable rewrite systems
- Problems in rewriting III
- Inductive-data-type systems
- Intersection type assignment systems with higher-order algebraic rewriting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281465)