Skip to content

Subtyping, Set Theory and Well Definedness

Amin Bandali edited this page Sep 20, 2016 · 1 revision

Tasks

  • Rename Document.Expression to Logic.Expr.Parser
  • Clean up the Logic.Expr.Parser API
  • Generalize Sequent so that, after applying monotonicity in the theorem prover, the goal is a non-empty list of predicates each of which can benefit from removing universals and "stabbing the onion"
  • Separate expression parsing from type checking
  • Make it easy to change the type system (not necessarily dynamically)
  • Draw contract

Goals

  • have records as subtypes of functions
  • have tuples as subtypes of lists, themselves subtypes of functions
  • have natural numbers as subtypes of Int, Rat, Real, Complex, Number

Clone this wiki locally