Cited in
(only showing first 100 items - show all)- Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories
- Reachability analysis of term rewriting systems with Timbuk
- The use of a strategy language for solving search problems
- Verifying an infinite systolic algorithm using third-order equational methods
- Two case studies of semantics execution in Maude: CCS and LOTOS
- scientific article; zbMATH DE number 1722700 (Why is no real title available?)
- Reflection in conditional rewriting logic
- scientific article; zbMATH DE number 1231673 (Why is no real title available?)
- A rewriting logic approach to operational semantics
- scientific article; zbMATH DE number 1956498 (Why is no real title available?)
- scientific article; zbMATH DE number 1956559 (Why is no real title available?)
- Proof search and proof check for equational and inductive theorems.
- Recent Trends in Algebraic Development Techniques
- Rewriting, inference, and proof
- Proving weak properties of rewriting
- Rewriting strategies and strategic rewrite programs
- Sharing in the graph rewriting calculus
- scientific article; zbMATH DE number 1231672 (Why is no real title available?)
- Typed generic traversal with term rewriting strategies
- A \(\rho\)-calculus of explicit constraint application
- scientific article; zbMATH DE number 2043519 (Why is no real title available?)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- scientific article; zbMATH DE number 2089377 (Why is no real title available?)
- Manipulating algebraic specifications with term-based and graph-based representations
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- scientific article; zbMATH DE number 1688813 (Why is no real title available?)
- scientific article; zbMATH DE number 1231657 (Why is no real title available?)
- scientific article; zbMATH DE number 2048606 (Why is no real title available?)
- A survey of rewriting strategies in program transformation systems
- scientific article; zbMATH DE number 2043545 (Why is no real title available?)
- An update calculus for expressing type-safe program updates
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Labelled graph strategic rewriting for social networks
- Specification of real-time and hybrid systems in rewriting logic
- scientific article; zbMATH DE number 1323194 (Why is no real title available?)
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- Correctness of dataflow and systolic algorithms using algebras of streams
- Strategies for combining decision procedures
- Handbook of constraint programming.
- Computationally Equivalent Elimination of Conditions
- Labelled graph rewriting meets social networks
- scientific article; zbMATH DE number 1231542 (Why is no real title available?)
- ASF+SDF parsing tools applied to ELAN
- Handling relations over finite domains in the rule-based system ELAN
- Rewriting logic as a framework for generic verification tools
- Termination and normalisation under strategy proofs in ELAN
- An integrated framework for the diagnosis and correction of rule-based programs
- scientific article; zbMATH DE number 1615244 (Why is no real title available?)
- Term rewriting with type-safe traversal functions
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Reachability in conditional term rewriting systems
- Strategy based semantics for mobility with time and access permissions
- HasCasl
- Stratego
- Tiburon
- CLAIRE
- BABEL
- ANTLR
- ATERM
- OMRS
- TAMPR
- OBJ3
- CafeOBJ
- Maude
- Timbuk
- PORGY
- FSA
- PMaude
- Kima
- Kernel-LEAF
- Polyp
- TeaBag
- CARIBOO
- JITty
- Tom
- VMTL
- ASF+SDF
- TXL
- visone
- Conditional Confluence
- SmallEiffel
- LOTOSphere
- KIDS
- bc
- DiSCiPl
- UNITS
- MOSBIE
- GP 2
- External rewriting for skeptical proof assistants
- Higher-order matching for program transformation
- Automated Reasoning
- A survey of strategies in rule-based program transformation systems
- Programming and symbolic computation in Maude
- scientific article; zbMATH DE number 1975616 (Why is no real title available?)
- ELAN from a rewriting logic point of view
- Complete Categorical Deduction for Satisfaction as Injectivity
- scientific article; zbMATH DE number 1617293 (Why is no real title available?)
- The metafront system: safe and extensible parsing and transformation
- Tiburon: A Weighted Tree Automata Toolkit
This page was built for software: ELAN
