Healfdene Goguen

Learn More
This paper gives a reduction-preserving translation from Coquand’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 recursive pattern matching programs, provides an implementable compilation technique in(More)
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 quantifiers. We define a typed operational semantics with subtyping and prove that it is(More)
This paper summarizes our experience with ECharts, a state machine language that played a key role in the design and implementation of AT&T CallVantage, a nationally deployed voice-over-IP service. The introduction outlines the history of the language, including the original design requirements for the language, our realization that existing languages did(More)