Functional / Logic Programming in Verse
summary
Verse claims a tight integration of functional and logic programming with a working prototype and a fresh denotational story: choices and failures are first-class, ordered choices reify into arrays via the for operator and return to computations with the “magic” colon; arrays are just finite functions and indexing outside the domain fails rather than throws; effects use annotations like succeeds versus decides; denotational semantics model core features by representing functions as ZF sets (graphs) to avoid heavy domain theory and this approach successfully explains narrowing, ordered vs unordered choices, and type-as-function encoding.
AI-written summary · about
chapters (9)
- 0:00Verse introduction and goals
- 4:35What is Verse
- 8:53Verse syntax and binding
- 11:49Choice and failure
- 20:07Arrays as functions
- 33:30Narrowing and iteration
- 43:53Types as functions
- 50:38Denotational semantics
- 1:04:12Summary and future
related talks
35mVerse - a new functional logic language
54mWhy Games Are Positioned to Revolutionize Programming Languages
18mWell I Wouldn't Want To Make a *Dys*functional Game
11mGames People Play
16mA Rose Tree is Blooming (Proof Pearl)
54mfn and Games with Arcadia
38mProcedural Generation at Runtime: From Basic to Complex by Example
35mGame Development Development