swMATH2179MaRDI QIDQ14723FDOQ14723
Author name not available (Why is that?)
Official website: http://elan.loria.fr
Cited In (only showing first 100 items - show all)
- The use of a strategy language for solving search problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recent Trends in Algebraic Development Techniques
- Rewriting, inference, and proof
- Title not available (Why is that?)
- Manipulating algebraic specifications with term-based and graph-based representations
- Title not available (Why is that?)
- A survey of rewriting strategies in program transformation systems
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Title not available (Why is that?)
- Labelled graph strategic rewriting for social networks
- Strategies for combining decision procedures
- Labelled graph rewriting meets social networks
- 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
- Title not available (Why is that?)
- Combining higher-order and first-order computation using \(\rho\)-calculus: Towards a semantics of ELAN
- Programming and symbolic computation in Maude
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strategic port graph rewriting: an interactive modelling framework
- A formal approach to object-oriented software engineering
- A rule-based approach to the implementation of evaluation strategies
- Certifying term rewriting proofs in ELAN
- Applying ELAN strategies in simulating processors over simple architectures
- Generic type-preserving traversal strategies
- Title not available (Why is that?)
- The control layer in open mechanized reasoning systems: Annotations and tactics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Term collections in {\(\lambda\)} and {\(\rho\)}-calculi
- Title not available (Why is that?)
- Reachability analysis of term rewriting systems with Timbuk
- Verifying an infinite systolic algorithm using third-order equational methods
- Title not available (Why is that?)
- Two case studies of semantics execution in Maude: CCS and LOTOS
- Reflection in conditional rewriting logic
- Title not available (Why is that?)
- Proof search and proof check for equational and inductive theorems.
- A rewriting logic approach to operational semantics
- Proving weak properties of rewriting
- Rewriting strategies and strategic rewrite programs
- Sharing in the graph rewriting calculus
- Title not available (Why is that?)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
- Title not available (Why is that?)
- Typed generic traversal with term rewriting strategies
- A \(\rho\)-calculus of explicit constraint application
- 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?)
- Title not available (Why is that?)
- Correctness of dataflow and systolic algorithms using algebras of streams
- An update calculus for expressing type-safe program updates
- Title not available (Why is that?)
- Handbook of constraint programming.
- Specification of real-time and hybrid systems in rewriting logic
- Computationally Equivalent Elimination of Conditions
- Title not available (Why is that?)
- Term rewriting with type-safe traversal functions
- An integrated framework for the diagnosis and correction of rule-based programs
- 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
- Higher-order matching for program transformation
- External rewriting for skeptical proof assistants
- HasCasl
- Tiburon
- CLAIRE
- OBJ3
- CafeOBJ
- Maude
- Timbuk
- PORGY
- Automated Reasoning
- FSA
- PMaude
- Kima
- Kernel-LEAF
- Polyp
- TeaBag
- CARIBOO
- JITty
- Tom
- VMTL
- ASF+SDF
- TXL
- visone
This page was built for software: ELAN