search

kory33 / scala-proofs

An attempt to build axiomatic, formal set theory on top of Scala.
37 stars 1 forks source link

Use typeclass instead of upper type bound to represent a domain of discourse #8

Open kory33 opened 5 years ago

kory33 commented 5 years ago

This should be possible. I'm just not sure how unpleasant grammars would look like.

kory33 commented 5 years ago

The main reason for this proposal arises from #2. Typeclass approach makes the whole constructions a lot more constructive, which will be more mathematical and less reliant on type system.