This paper gives a reduction-preserving translation from Co-quand's dependent pattern matching  into a traditional type theory  with universes, inductive types and relations and the axiom K . This translation serves as a proof of termination for structurally recur-sive pattern matching programs, provides an implementable compilation technique in… (More)
AT&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)
We present four constructions for standard equipment which can be generated for every inductive datatype: case analysis, structural recursion, no confusion, acyclicity. Our constructions follow a two-level approach—they require less work than the standard techniques which inspired them [11, 8]. Moreover, given a suitably heterogeneous notion of equality,… (More)
This paper shows that the subtyping relation of a higher-order lambda calculus, F ! , is anti-symmetric. It exhibits the rst such proof, establishing in the process that the subtyping relation is a partial order| reeexive, transitive and anti-symmetric. While a sub-typing relation is reeexive and transitive by deeni-tion, anti-symmetry is a derived… (More)