Pinafore: Strongly Typed Information Representation
summary
A strongly typed functional language for personal data, implemented in Haskell, claims decidable subtyping by using Algebraic Subtyping (Stephen Dolan) and stores everything as triples in a SQLite-backed triple table and literal table. Types are erased from storage; anchors (hashed strings) bind schema to data. It builds composable UI widgets that watch reference and set-ref values; proof-of-concept works but lacks file storage, recursive entity types, and has noticeable performance and overloading rough edges.
AI-written summary · about
chapters (18)
- 0:00Start
- 0:21The Information Problem
- 1:50Language
- 3:14Subtypes
- 4:58Type Constuctors
- 6:34Type Lattice
- 7:53Type Examples
- 10:33Storage Example
- 11:29Example Pinafore
- 12:23Example Declarations
- 14:11Example Types
- 17:54Morphisms
- 18:39Set References
- 19:18User Interfaces
- 21:40Open Entity Types
- 22:19Closed Entity Types
- 23:52Entity Type Hierarchy
- 27:16Pinafore Current Status
