Re: draft-phillips-langtags-08, process, sp ecifications, "stability",

ned(_dot_)freed(_at_)mrochek(_dot_)com scripsit:

> What would be really nice is to specify a parameterized matching
> algorithm (or more precisely, an algorithm family) along the lines
> of the stringprep family of string normalization algorithms. But
> I'm unsure if there's sufficient time and interest available to do
> this. But it is nice to dream...
That would be a Good Thing indeed.  However, it is definitely out of
scope for this draft, as it would stretch the definition of BCP well
beyond the breaking point.  If there's any defending the presence of an
*algorithm* in a BCP at all, it's because we are not making the algorithm
normative, but just saying "The most commonly used algorithm is".

-- 
[W]hen I wrote it I was more than a little              John Cowan
febrile with foodpoisoning from an antique carrot       
jcowan(_at_)reutershealth(_dot_)com
that I foolishly ate out of an illjudged faith          www.ccil.org/~cowan
in the benignancy of vegetables.  --And Rosta           www.reutershealth.com

_______________________________________________
Ietf mailing list
Ietf(_at_)ietf(_dot_)org
https://www1.ietf.org/mailman/listinfo/ietf