Author:
Bouhoula Adel,Jouannaud Jean-Pierre,Meseguer José
Subject
General Computer Science,Theoretical Computer Science
Reference87 articles.
1. Mechanizing structural induction;Aubin;Theoret. Comput. Sci.,1979
2. L. Bachmair, Proof by consistency in equational theories, Proc. 3rd IEEE Symp. on Logic in Computer Science, Edinburgh, UK, 1988, pp. 228–233.
3. Toposes, Triples and Theories;Barr,1985
4. K. Becker, Inductive proofs in specifications parameterized by a built-in theory, SEKI-Report SR-92-02, Universität Kaiserslautern, 1992.
5. J.A. Bergstra, J.V. Tucker, Characterization of computable data types by means of a finite equational specification method, in: J.W. de Bakker, J. van Leeuwen (Eds.), Proc. 7th Internat. Conf. on Automata, Languages and Programming, Lecturer Notes in Computer Science, vol. 81, Springer, Berlin, 1980, pp. 76–90.
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maude2Lean: Theorem proving for Maude specifications using Lean;Journal of Logical and Algebraic Methods in Programming;2025-01
2. Programming Open Distributed Systems in Maude;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
3. NuITP: An Inductive Theorem Prover for Equational Program Verification;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09
4. Modular rewritable Petri nets: An efficient model for dynamic distributed systems;Theoretical Computer Science;2024-04
5. Modelling Adaptive Systems with Maude Nets-within-Nets;Lecture Notes in Networks and Systems;2024