Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

DOI10.1016/J.TCS.2006.12.009zbMATH Open1111.03034OpenAlexW2131954800MaRDI QIDQ875516FDOQ875516

Authors: M. Clavel, Miguel Palomino, José Meseguer 

Publication date: 13 April 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.009

Recommendations

• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• scientific article; zbMATH DE number 1231672
• scientific article; zbMATH DE number 1231659
• Automated Deduction – CADE-20
• Specification and proof in membership equational logic
• Some Varieties of Equational Logic
• scientific article; zbMATH DE number 1670742
• scientific article; zbMATH DE number 1189278
• scientific article; zbMATH DE number 67036
• Reflection principles in computational logic

zbMATH Keywords

reflectionrewriting logicMaudeuniversal theoriesmembership equational logicreflective logicsreflective programming languages

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Cites Work

• Maude: specification and programming in rewriting logic
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• The concept of a supercompiler
• Specification of real-time and hybrid systems in rewriting logic
• Title not available (Why is that?)
• Metamathematics, Machines and Gödel's Proof
• On degrees of unsolvability
• Monadic Elementary Formal Systems
• CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
• Conditional rewriting logic as a unified model of concurrency
• IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
• An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
• Title not available (Why is that?)
• Title not available (Why is that?)
• WRLA 2002. Proceedings of the 4th international workshop on rewriting logic and its applications, Pisa, Italy, September 19--21, 2002
• Proceedings of the 6th international workshop on rewriting logic and its applications (WRLA 2006), Vienna, Austria, April 1--2, 2006
• Handbook of philosophical logic. Vol. 9
• Specification and proof in membership equational logic
• Title not available (Why is that?)
• Rewriting logic: Roadmap and bibliography
• ELAN from a rewriting logic point of view
• Algebraic Methodology and Software Technology
• Reflection in conditional rewriting logic
• Reflection in rewriting logic. Metalogical foundations and metaprogramming applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Interpreting abstract interpretations in membership equational logic
• Comparing Meseguer's rewriting logic with the logic CRWL
• Title not available (Why is that?)
• A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
• Reflective metalogical frameworks
• A generic reification technique for object-oriented reflective languages
• Metalevel architectures and separation of crosscutting concerns. 3rd international conference, REFLECTION 2001, Kyoto, Japan, September 25--28, 2001. Proceedings

Cited In (16)

• Twenty years of rewriting logic
• Symbolic computation in Maude: some tapas
• Building correct-by-construction systems with formal patterns
• An algebraic semantics for MOF
• Metalevel algorithms for variant satisfiability
• Title not available (Why is that?)
• Declarative Debugging of Rewriting Logic Specifications
• Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
• Programming and symbolic computation in Maude
• Metalevel transformation of strategies
• Title not available (Why is that?)
• Rewriting modulo SMT and open system analysis
• A declarative debugger for Maude functional modules
• Metalevel algorithms for variant satisfiability
• A Maude environment for CafeOBJ
• Declarative debugging of rewriting logic specifications

Uses Software

• CafeOBJ
• Maude
• ITP
• Refal

This page was built for publication: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875516)