Computer Science – Logic in Computer Science
Scientific paper
2011-03-17
EPTCS 53, 2011, pp. 16-29
Computer Science
Logic in Computer Science
In Proceedings TYPES 2009, arXiv:1103.3111
Scientific paper
10.4204/EPTCS.53.2
We introduce the notion of nonuniform coercion, which is the promotion of a value of one type to an enriched value of a different type via a nonuniform procedure. Nonuniform coercions are a generalization of the (uniform) coercions known in the literature and they arise naturally when formalizing mathematics in an higher order interactive theorem prover using convenient devices like canonical structures, type classes or unification hints. We also show how nonuniform coercions can be naturally implemented at the user level in an interactive theorem prover that allows unification hints.
Coen Claudio Sacerdoti
Tassi Enrico
No associations
LandOfFree
Nonuniform Coercions via Unification Hints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nonuniform Coercions via Unification Hints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonuniform Coercions via Unification Hints will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-247373