The following pages link to (Q3809236):
Displaying 19 items.
- Topological methods for algebraic specification (Q671657) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Universal algebra in higher types (Q1199827) (← links)
- A recursive second order initial algebra specification of primitive recursion (Q1338890) (← links)
- A completeness theorem for the expressive power of higher-order algebraic specifications (Q1362341) (← links)
- Order-sorted algebraic specifications with higher-order functions (Q1391097) (← links)
- Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. (Q1401983) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- On the power of higher-order algebraic specification methods (Q1908358) (← links)
- Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally (Q2254574) (← links)
- Comorphisms of structured institutions (Q2445331) (← links)
- Verifying an infinite systolic algorithm using third-order equational methods (Q2500698) (← links)
- First-order specifications of programmable data types (Q2719126) (← links)
- Algebraic specifications, higher-order types and set-theoretic models (Q2752531) (← links)
- R n - and G n -logics (Q4645806) (← links)
- Higher-order algebra with transfinite types (Q4645814) (← links)
- Order-sorted algebraic specifications with higher-order functions (Q5096382) (← links)
- A decade of TAPSOFT (Q5096723) (← links)
- Algebraic semantics of rewriting terms and types (Q5881172) (← links)
