Closed nominal rewriting and efficiently computable nominal algebra equality - Computer Science > Logic in Computer ScienceReportar como inadecuado




Closed nominal rewriting and efficiently computable nominal algebra equality - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We analyse the relationship between nominal algebra and nominal rewriting,giving a new and concise presentation of equational deduction in nominaltheories. With some new results, we characterise a subclass of equationaltheories for which nominal rewriting provides a complete procedure to checknominal algebra equality. This subclass includes specifications of thelambda-calculus and first-order logic.



Autor: Maribel Fernández King's College London, Murdoch J. Gabbay Heriot-Watt University

Fuente: https://arxiv.org/







Documentos relacionados