The following pages link to (Q4346205):
Displaying 24 items.
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications (Q968529) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Algebraic translations, correctness and algebraic compiler construction (Q1129121) (← links)
- A hidden agenda (Q1575735) (← links)
- A hidden Herbrand theorem: Combining the object and logic paradigms (Q1858427) (← links)
- Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention (Q2188772) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- Closures in Binary Partial Algebras (Q2994476) (← links)
- ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING (Q3062792) (← links)
- Matching Logic: An Alternative to Hoare/Floyd Logic (Q3067473) (← links)
- A lightweight approach to datatype-generic rewriting (Q3070774) (← links)
- The Rewriting Logic Semantics Project: A Progress Report (Q3088267) (← links)
- Action Algebras and Model Algebras in Denotational Semantics (Q3184749) (← links)
- A Step-indexed Semantics of Imperative Objects (Q3401137) (← links)
- Aliasing Control in an Imperative Pure Calculus (Q3460909) (← links)
- On the interpretation of mathematical entities in the formalisation of programming and modelling languages (Q3545271) (← links)
- (Q3809233) (← links)
- (Q3816960) (← links)
- (Q4723273) (← links)
- A Proof Score Approach to Formal Verification of an Imperative Programming Language Compiler (Q5056076) (← links)
- Building Specifications in the Event-B Institution (Q5060190) (← links)
- Programming language semantics: It’s easy as 1,2,3 (Q6065508) (← links)
