Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved-Reference-Cited by-同舟云学术

Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved

Published:1991 Issue: Volume: Page:259-271
ISSN:0302-9743
Container-title:Conditional and Typed Rewriting Systems
language:
Short-container-title:

Author:

Barbanera Franco

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54317-1_96.pdf

Reference7 articles.

1. F.Barbanera. Combining term rewriting and type assignment systems. Proceedings Third Italian Conference on Theoretical Computer Science. pp.71–84. Mantova.Bertoni, Boehm, Miglioli Eds. Nov. 1989.

2. Val Breazu-Tannen, Jan Gallier. Polymorphic rewriting conserves algebraic strong normalization. To appear in TCS.

3. T. Coquand, G. Huet. The Calculus of Constructions. Information and Control, pp.76–95, 120, 1988.

4. M. Coppo, M. Dezani-Ciancaglini, B. Venneri. Functional character of solvable terms. Zeit.Math.Logik und Grund.Math. 27, pp.45–58, 1981.

5. H.Geuvers, M.J.Nederhof. A simple modular proof of the strong nonnalization for the Calculus of Constructions. To appear in "Journal of Functional Programming".

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Modularity of termination and confluence in combinations of rewrite systems with λω;Automata, Languages and Programming;1993

2. A combinatory logic approach to higher-order E-unification (extended abstract);Automated Deduction—CADE-11;1992

3. Adding algebraic rewriting to the untyped lambda calculus (extended abstract);Rewriting Techniques and Applications;1991

4. Towards Rewriting in Coq;Rewriting, Computation and Proof

5. Combining first and higher order rewrite systems with type assignment systems;Lecture Notes in Computer Science