The following pages link to (Q3490936):
Displayed 11 items.
- On the verification of security-aware E-services (Q429592) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- A rewrite-based type discipline for a subset of computer algebra (Q1176783) (← links)
- An order-sorted logic for knowledge representation systems (Q1193487) (← links)
- A resolution principle for constrained logics (Q1327159) (← links)
- Unification in sort theories and its applications (Q1380412) (← links)
- Specification and correctness proof of a WAM extension with abstract type constraints (Q1815343) (← links)
- Refinement of a typed WAM extension by polymorphic order-sorted types (Q1816918) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Dynamically-typed computations for order-sorted equational presentations (Q4632447) (← links)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)