Pages that link to "Item:Q1089793"
From MaRDI portal
The following pages link to On the implementation of abstract data types by programming language constructs (Q1089793):
Displaying 14 items.
- Paragon: a language using type hierarchies for the specification, implementation and selection of abstract data types (Q761792) (← links)
- Pebble, a kernel language for modules and abstract data types (Q1104071) (← links)
- Correctness proofs for abstract implementations (Q1119388) (← links)
- A systematic catalogue of reusable abstract data types (Q1188908) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- (Q3138542) (← links)
- (Q3687690) (← links)
- (Q3757375) (← links)
- (Q4023846) (← links)
- (Q4295355) (← links)
- Simulating expansions without expansions (Q4322432) (← links)
- A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object (Q4630299) (← links)
- A confluent reduction for the λ-calculus with surjective pairing and terminal object (Q4895554) (← links)
- Some lambda calculi with categorical sums and products (Q5055791) (← links)