We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
A type system for object models is described that supports subtypes and allows overloading of relation names. No special features need be added to the modelling language; in parti...
This paper considers three assumptions conventionally made about signatures in typed feature logic that are in potential disagreement with current practice among grammar developer...
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...
Transcription factor binding sites often contain several subtypes of sequences that follow not just one but several different patterns. We developed a novel sensitive method based ...