A New Look at Generalized Rewriting in Type Theory
Rewriting is an essential tool for computer-based reasoning, both automated and assisted. This is because rewriting is a general notion that permits modeling a wide range of problems and provides a means to effectively solve them. In a proof assistant, rewriting can be used to replace terms in arbit...
Main Author: | Matthieu Sozeau |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Bologna
2009-01-01
|
Series: | Journal of Formalized Reasoning |
Online Access: | http://jfr.cib.unibo.it/article/view/1574/1077 |
Similar Items
-
Un environnement pour la programmation avec types dépendants
by: Matthieu, Sozeau
Published: (2008) -
Another Look at Joyceans: Evelyn Conlon’s Rewrite of “Two Gallants”
by: Izabela Curyłło-Klag
Published: (2019-12-01) -
Partial Evaluation of Rewriting Logic Theories
by: Cuenca Ortega, Ángel Eduardo
Published: (2019) -
Regulated rewriting in formal language theory
by: Taha, Mohamed A. M. S
Published: (2008) -
Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study
by: Cyprien Mangin, et al.
Published: (2015-07-01)