The following pages link to (Q3853107):
Displayed 11 items.
- Characterizing specification languages which admit initial semantics (Q792080) (← links)
- Partial evaluation and \(\omega\)-completeness of algebraic specifications (Q1084849) (← links)
- Crypt-equivalent algebraic specifications (Q1095646) (← links)
- Algebraic specifications of computable and semicomputable data types (Q1098613) (← links)
- Algebras with finitely approximable positively representable enrichments (Q1119572) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Recursive unary algebras and trees (Q1326781) (← links)
- The data type variety of stack algebras (Q1891249) (← links)
- On algebraic specifications of computable algebras with the discriminator technique (Q3358246) (← links)
- (Q3662598) (← links)
- A simple transfer lemma for algebraic specifications (Q5905240) (← links)