#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1954

2017

- This year (2)
- Last 5 years (15)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Conor McBride, James McKinna
- J. Funct. Program.
- 2004

Pattern matching has proved an extremely powerful and durable notion in functional programming. This paper contributes a new programming notation for type theory which elaborates the notion in various ways. First, as is by now quite well-known in the type theory community, definition by pattern matching becomes a more discriminating tool in the presence of… (More)

- James McKinna, Robert Pollack
- Journal of Automated Reasoning
- 1999

We survey a substantial body of knowledge about lambda calculus and Pure Type Systems, formally developed in a constructive type theory using the LEGO proof system. On lambda calculus, we work up to an abstract, simplified proof of standardization for beta reduction that does not mention redex positions or residuals. Then we outline the meta theory of Pure… (More)

- Healfdene Goguen, Conor McBride, James McKinna
- Essays Dedicated to Joseph A. Goguen
- 2006

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)

- James McKinna
- POPL
- 2006

Language designers have in recent years proposed a wealth of richer type systems for programming which seek to extend the range of statically enforced guarantees on data and code. Most such proposals have been evolutionary extensions of ML or Haskell, offering programmers a balanced compromise between expressive strength and existing well-understood… (More)

- James McKinna, Robert Pollack
- TLCA
- 1993

This paper is about our hobby. For us, machine-checked mathematics is a passion, and constructive type theory (in the broadest sense) is the way to this objective. Efficient and correct type-checking programs are necessary, so a formal theory of type systems leading to verified type synthesis algorithms is a natural goal. For over a year the second author… (More)

- L. S. van Benthem Jutting, James McKinna, Robert Pollack
- TYPES
- 1993

- Edwin Brady, Conor McBride, James McKinna
- TYPES
- 2003

- D O Cosgrove, R P Kedar, +7 authors E Vagios
- Radiology
- 1993

PURPOSE
To subjectively and semiquantitatively evaluate color Doppler signals on images of breast lesions.
MATERIALS AND METHODS
A 5-MHz ultrasound (US) system was used to examine 210 new breast lesions. Signals were evaluated subjectively with an analog scale. A semiquantitative scoring system involved analysis of the average number of vessels per square… (More)

- T. J. Powles, J. R. Hardy, +7 authors H. D. Sinnett
- British journal of cancer
- 1989

Epidemiological and experimental evidence indicates that oestrogens are involved in the carcinogenic promotion of human breast cancer. We have undertaken a pilot trial of tamoxifen, an anti-oestrogen, compared to placebo given to 200 women at a high risk of developing breast cancer. The results of this trial show that acute toxicity is low and that accrual… (More)

- Conor McBride, James McKinna
- Haskell
- 2004

In this paper, we show how to manipulate syntax with binding using a mixed representation of names for free variables (with respect to the task in hand) and de Bruijn indices [5] for bound variables. By doing so, we retain the advantages of both representations: naming supports easy, arithmetic-free manipulation of terms; de Bruijn indices eliminate the… (More)