# Harry Mairson

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Mathematical Structures in Computer Science
- 2008

X is an untyped continuation-style formal language with a typed subset which provides a Curry-Howard isomorphism for a sequentâ€¦Â (More)

Is this relevant?

2007

2007

- 22nd Annual IEEE Symposium on Logic in Computerâ€¦
- 2007

Typing of lambda-terms in elementary and light affine logic (EAL , LAL resp.) has been studied for two different reasons: on theâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

Representing aÎ»-calculus term as a DAG rather than a tree allows us to represent the sharing that arises from Î²-reduction, thusâ€¦Â (More)

Is this relevant?

2005

2005

- 2005

A debugger is a tool that allows the programmer to view some aspect of the running program. This paper will present aâ€¦Â (More)

Is this relevant?

1997

1997

- 1997

In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances ofâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Inf. Comput.
- 1995

Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-orientedâ€¦Â (More)

Is this relevant?

1990

1990

- CAAP
- 1990

We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIMEâ€¦Â (More)

Is this relevant?