Learn More
This paper gives a reduction-preserving translation from Co-quand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types and relations and the axiom K [22]. This translation serves as a proof of termination for structurally recur-sive pattern matching programs, provides an implementable compilation technique in(More)
AT&#38;T CallVantage<sup><i>SM</i></sup> service is a consumer broadband voice-over-Internet-protocol (VoIP) service. Its feature server has a component-based architecture. This paper is a brief report on our experience with building and deploying advanced telecommunication features using component-based technology.
Bounded operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce F ! , a variant of F ! <: with this feature and with Cardelli and Wegner's kernel Fun rule for quantiiers. We deene a typed operational semantics with subtyp-ing and prove that it is(More)