OBJ3
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A rewriting logic approach to operational semantics
- Operational termination of conditional term rewriting systems
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy
- Conditional rewriting logic as a unified model of concurrency
- Constructing specification morphisms
- Normal form approach to compiler design
- OBSCURE, a specification language for abstract data types
- Gordon's computer: A hardware verification case study in OBJ3
- Verifying a distributed list system: A case history
- Essential concepts of algebraic specification and program development
- Program tactics and logic tactics
- Order-sorted algebraic specifications with higher-order functions
- May I borrow your logic? (Transporting logical structures along maps)
- Abstract data type systems
- Stratego
- Jakarta
- Symstra
- CLEAN
- CoFI
- JavaFAN
- ToolBus
- LARCH
- ELAN
- CASL
- OBSCURE
- ATERM
- TAMPR
- A hidden agenda
- POOL
- CCSL
- TRAM
- Maude: specification and programming in rewriting logic
- Logical foundations of CafeOBJ
- Equational rules for rewriting logic
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
- Automatic synthesis of logical models for order-sorted first-order theories
- Miranda
- Algebraic models of microprocessors architecture and organisation
- CIRC
- CafeOBJ
- Maude
- CASL: the Common Algebraic Specification Language.
- Relating CASL with other specification languages: the institution level.
- Context-sensitive rewriting strategies
- A hidden Herbrand theorem: Combining the object and logic paradigms
- Structured theories and institutions
- Category-based modularisation for equational logic programming
- Kumo
- 2OBJ
- Hets
- Z2sal
- Mechanising the theory of intervals using OBJ3
- Principles of proof scores in CafeOBJ
- Rostra
- Eclat
- Twenty years of rewriting logic
- STEXIDE
- Specification and proof in membership equational logic
- Tyrolean
- AProVE
- MMT
- PMaude
- PVeStA
- Applications and extensions of context-sensitive rewriting
- Derivational complexity and context-sensitive Rewriting
- Creol
- OOZE
- K-Maude
- MFE
- CSI
- ChC 3
- CRC 3
- MTT
- ITP
- SCC
- DDebugger
- CiME
- MU-TERM
- CARIBOO
- VMTL
- Saigawa
- TPA
- Matchbox
- Tsukuba
- InvA
- BMaude
- UniForM
- Proving operational termination of membership equational programs
- Programming and symbolic computation in Maude
- Ground confluence of order-sorted conditional specifications modulo axioms
- TXL
- Morphism axioms
- Maude-NPA
- A modular order-sorted equational generalization algorithm
- A survey of strategies in rule-based program transformation systems
- Institution-independent model theory
- JCrasher
- CoCasl
- Algebraic correctness proofs for compiling recursive function definitions with strictness information
- Conditional Confluence
This page was built for software: OBJ3
