Skip to search formSkip to main contentSkip to account menu

Harry Mairson

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

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 that provides a Curry–Howard isomorphism for a sequent… 
2005
2005
If we represent a λ-calculus term as a DAG rather than a tree, we can efficiently represent the sharing that arises from… 
2005
2005
A debugger is a tool that allows the programmer to view some aspect of the running program. This paper will present a… 
2002
2002
Marcelo Dascal destaca en diversos articulos en los que analiza las consecuencias de la concepcion pragmatica del significado, la… 
2001
2001
1997
1997
In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances of… 
1994
1994
Church''s simply typed lambda-calculus is a very basic framework for functional programming language research. However, it is… 
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…