Sylvester: Unified, typed, notation for symbolic mathematics and proofs (short talk)
Sylvester is an F# embedded DSL for mathematical computing that provides a single notation based on F# quotations for mathematical and logical concepts and expressions, which supports an integrated approach to computer algebra, theorem-proving, visualization, and other applications in computer-based mathematics. Sylvester provides a typed, functional-first, object-based language that captures conceptual, symbolic, logical, and visual properties of mathematical statements, together with a unified interface to tools like proof assistants, CAS, SMT solvers, and graph drawing libraries. This presentation describes the rationale and motivation of the Sylvester project, how Sylvester is implemented in F#, and how it can be used in different mathematical domains from set theory to linear algebra to real analysis.
Extended abstract (ml21-paper32.pdf) | 265KiB |
Fri 27 AugDisplayed time zone: Seoul change
01:30 - 03:00 | |||
01:30 30mTalk | Frozen inference constraints for type-directed disambiguation ML Pre-print Media Attached | ||
02:00 15mTalk | Experience Report: Domain Modeling with F# (short talk) ML Scott Wlaschin None Media Attached File Attached | ||
02:15 15mTalk | Isomorphisms are back! (short talk) ML File Attached | ||
02:30 15mTalk | Sylvester: Unified, typed, notation for symbolic mathematics and proofs (short talk) ML Allister Beharry None Media Attached File Attached | ||
02:45 15mTalk | A Data-centered User Study for jsCoq (short talk) ML Hanneli Tavante McGill University File Attached |