export type Op = string | { op: string; a: Op; b: Op }; type RwType = 'rewrite' | 'imperative'; export interface RewriteBase { type: RwType; left: Op; right: Op; } export interface Rewrite extends RewriteBase { type: Typ; left: left; right: right; }; export type Sym = Rewrite; export type ApplyRewrite = R['type'] extends 'imperative' ? (R & { left: O })['right'] : O extends R['left'] ? R['right'] : O extends string ? O : O extends { a: Op, b: Op, op: string } ? ( ApplyRewrite extends O['a'] ? (ApplyRewrite extends O['b'] ? O : Omit & { b: ApplyRewrite }) : Omit & { a: ApplyRewrite } ) : never; export type ChainRewrites = Rws extends [] ? O : Rws extends [infer R extends RewriteBase, ...infer Rs extends RewriteBase[]] ? ChainRewrites> : never; export type VerifyEquation = Eq['right'] extends 'true' ? true : false & Eq['right']; export type Evaluate = ApplyRewrite; export type assert = T; export type Eq = ([a] extends [b] ? ([b] extends [a] ? true : false & { lhs: a; rhs: b }) : false & { lhs: a; rhs: b }); export type Equation = { op: '=', a: A, b: B }; export interface Refl extends RewriteBase { type: 'imperative'; left: Op; right: this['left'] extends { op: '=', a: infer a, b: infer b } ? (Eq extends true ? 'true' : this['left']) : this['left']; }; // Like Refl, but you have to specify the sides of the equation and this one works recursively export type ReflR = Rewrite, 'true'>;