lean2/tests/lean/bad_eqns.lean.expected.out

bad_eqns.lean:4:2: error: invalid argument, it is not a constructor, variable, nor it is marked as an inaccessible pattern
  0 + x
in the following equation left-hand-side
  foo (0 + x)
bad_eqns.lean:8:2: error: invalid equation left-hand-side, variable 'y' only occurs in inaccessible terms in the following equation left-hand-side
  foo x y
bad_eqns.lean:10:11: error: invalid recursive equations for 'foo', inconsistent use of inaccessible term annotation, in some equations a pattern is a constructor, and in another it is an inaccessible term
bad_eqns.lean:21:11: error: mutual recursion is not needed when defining non-recursive functions
bad_eqns.lean:34:11: error: invalid recursive equations, failed to find recursive arguments that are structurally smaller (possible solution: use well-founded recursion)
feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`bad_eqns.lean:4:2: error: invalid argument, it is not a constructor, variable, nor it is marked as an inaccessible pattern`
test(tests/lean/bad_eqns): add tests for definition package error messages 2015-02-02 03:36:06 +00:00			`0 + x`
			`in the following equation left-hand-side`
			`foo (0 + x)`
feat(frontends/lean): ML-like notation for match and recursive equations 2015-02-26 00:20:44 +00:00			`bad_eqns.lean:8:2: error: invalid equation left-hand-side, variable 'y' only occurs in inaccessible terms in the following equation left-hand-side`
test(tests/lean/bad_eqns): add tests for definition package error messages 2015-02-02 03:36:06 +00:00			`foo x y`
			`bad_eqns.lean:10:11: error: invalid recursive equations for 'foo', inconsistent use of inaccessible term annotation, in some equations a pattern is a constructor, and in another it is an inaccessible term`
			`bad_eqns.lean:21:11: error: mutual recursion is not needed when defining non-recursive functions`
			`bad_eqns.lean:34:11: error: invalid recursive equations, failed to find recursive arguments that are structurally smaller (possible solution: use well-founded recursion)`