| Termination of algebraic type systems: the syntactic approach (1997) | |||||||||||||||||
Abstract | |||||||||||||||||
| Combinations of type theory and rewriting are of obvious interest for the study of higher-order programming and program transformation with algebraic data types specifications; more recently, they also found applications in proof-checking. | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||