Communicating sequential processes
Communicating sequential processes
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Theoretical Computer Science
Information and Computation - Semantics of Data Types
Elf: a language for logic definition and verified metaprogramming
Proceedings of the Fourth Annual Symposium on Logic in computer science
Encoding a dependent-type &lgr;-calculus in a logic programming language
CADE-10 Proceedings of the tenth international conference on Automated deduction
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Action semantics
A framework for defining logics
Journal of the ACM (JACM)
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Handbook of logic in computer science (vol. 2)
Using typed lambda calculus to implement formal systems on a machine
Journal of Automated Reasoning
Computation and reasoning: a type theory for computer science
Computation and reasoning: a type theory for computer science
Papers presented at the second annual Workshop on Logical environments
Experience with FS100 as a framework theory
Papers presented at the second annual Workshop on Logical environments
Closure under alpha-conversion
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
General logics and logical frameworks
What is a logical system?
May I borrow your logic? (Transporting logical structures along maps)
Theoretical Computer Science - Special issue: algebraic development techniques
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
From Abstract Data Types to Logical Frameworks
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Semantic Foundations for Embedding HOL in Nuprl
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Rewriting: An Effective Model of Concurrency
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
The Calculus of algebraic Constructions
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
The Semantics of CLEAR, A Specification Language
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Process and Term Tile Logic
In Search of a Phase Transition in the AC-Matching Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Verified Software: Theories, Tools, Experiments
Tool interoperability in the Maude formal environment
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Towards a Maude formal environment
Formal modeling
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Hi-index | 0.00 |
Given the different perspectives from which a complex software system has to be analyzed, the multiplicity of formalisms is unavoidable. This poses two important technical challenges: how to rigorously meet the need to interrelate formalisms, and how to reduce the duplication of effort in tool and specification building across formalisms. These challenges could be answered by adequate formal meta-tools that, when given the specification of a formal inference system, generate an efficient inference engine, and when given a specification of two formalisms and a translation, generate an actual translator between them. Similarly, module composition operations that are logic-independent, but that at present require costly implementation efforts for each formalism, could be provided for logics in general by module algebra generator meta-tools. The foundations of meta-tools of this kind can be based on a metatheory of general logics. Their actual design and implementation can be based on appropriate logical frameworks having efficient implementations. This paper explains how the reflective logical framework of rewriting logic can be used, in conjunction with an efficient reflective implementation such as the Maude language, to design formal meta-tools such as those described above. The feasibility of these ideas and techniques has been demonstrated by a number of substantial experiments in which new formal tools and new translations between formalisms, efficient enough to be used in practice, have been generated.