Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Formal proofs about rewriting using ACL2

From MaRDI portal
Publication:1610218
Jump to:navigation, search

DOI10.1023/A:1016003314081zbMath1015.68169MaRDI QIDQ1610218

Jose Antonio Alonso, Francisco Jesús Martín-Mateos, José Luis Ruiz-Reina, María José Hidalgo

Publication date: 19 August 2002

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)


zbMATH Keywords

theorem provingformal verificationrewritingrewrite systemsACL2


Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)


Related Items

Unnamed Item, Formal correctness of a quadratic unification algorithm, A formalization of the Knuth-Bendix(-Huet) critical pair theorem, A PVS Theory for Term Rewriting Systems, A verified common lisp implementation of Buchberger's algorithm in ACL2


Uses Software

  • ACL2
  • LISP
  • Ivy


Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1610218&oldid=13911214"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki