Calculating datastructures
From MaRDI portal
Publication:6109206
DOI10.1007/978-3-031-16912-0_3OpenAlexW4296962393MaRDI QIDQ6109206
Publication date: 30 June 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-16912-0_3
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Manufacturing datatypes
- APLicative Programming with Naperian Functors
- Type Fusion
- A short survey of isomorphisms of types
- Finger trees: a simple general-purpose data structure
- Three algorithms on Braun trees
- Explaining binomial heaps
- Generalizing generalized tries
- Purely Functional Data Structures
- The view from the left
- Heterogeneous binary random-access lists
- Programming with ornaments
- Homotopy Type Theory: Univalent Foundations of Mathematics
- Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules
This page was built for publication: Calculating datastructures
