Elliot Fairweather

Learn More
We define rank 1 polymorphic types for nominal rewrite rules and equations. Typing environments type atoms, variables, and function symbols, and since we follow a Curry-style approach there is no need to fully annotate terms with types. Our system has principal types, and we give rule and axiom formats to guarantee preservation of types under both rewriting(More)
Nominal terms are an extended first-order language for specifying and verifying properties of syntax with binding. Founded upon the semantics of nominal sets, the success of nominal terms with regard to systems of equational reasoning is already well established. This work first extends the untyped language of nominal terms with a notion of non-capturing(More)
We present a logical framework based on the nominal approach to representing syntax with binders. First we extend nominal terms, which have a built-in name-abstraction operator and a first-order notion of substitution for variables, with a capture-avoiding substitution operator for names. We then build a dependent type system for this extended syntax and(More)
We present a logical framework based on the nominal approach to representing syntax with binders. First we extend nominal terms, which have a built-in name-abstraction operator and a first-order notion of substitution for variables, with a capture-avoiding substitution operator for names. We then build a dependent type system for this extended syntax and(More)
Decision support systems are used as a method of promoting consistent guideline-based diagnosis supporting clinical reasoning at point of care. However, despite the availability of numerous commercial products, the wider acceptance of these systems has been hampered by concerns about diagnostic performance and a perceived lack of transparency in the process(More)
  • 1