Harry Mairson

Harry George Mairson is a theoretical computer scientist and Professor of Computer Science in the Volen National Center for Complex Systems at… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
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
Typing of lambda-terms in elementary and light affine logic (EAL , LAL resp.) has been studied for two different reasons: on the… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 7
  • table 2
Is this relevant?
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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)
  • figure 3
  • figure 5
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
1997
1997
In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances of… (More)
  • figure 1-1
  • figure 1-2
  • table 1.1
  • table 1.12
  • table 2.3
Is this relevant?
Highly Cited
1995
Highly Cited
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
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?