A de Bruijn Notation for Higher-Order Rewriting

Authors:
Eduardo Bonelli;Delia Kesner;Alejandro Ríos
Affiliations:
-;-;-
Venue:
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Year:
2000

Citing 0
Cited 8

From Higher-Order to First-Order Rewriting

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Normalisation for higher-order calculi with explicit substitutions

Theoretical Computer Science - Foundations of software science and computation structures
The Open Calculus of Constructions (Part II): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving

Fundamenta Informaticae
A normalisation result for higher-order calculi with explicit substitutions

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Expression reduction systems with patterns

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Expression reduction systems and extensions: an overview

Processes, Terms and Cycles
On Explicit Substitution with Names

Journal of Automated Reasoning
The Open Calculus of Constructions (Part II): An Equational Type Theory with Dependent Types for Programming, Specification, and Interactive Theorem Proving

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract