Pages that link to "Item:Q5890041"
From MaRDI portal
The following pages link to Computational adequacy via ‘mixed’ inductive definitions (Q5890041):
Displaying 7 items.
- Computational inductive definability (Q598276) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- On the relations between monadic semantics (Q879354) (← links)
- A domain-theoretic semantics of lax generic functions. (Q1398469) (← links)
- Relational properties of domains (Q1923093) (← links)
- (Q4611384) (← links)
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving (Q4645809) (← links)