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)

Related topics

Related topics

12 relations
AlgorithmicsComputational complexity theoryFunctional programmingHigher-Order and Symbolic Computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Un desafío para las teorías cognitivas de la competencia lógica: los fundamentos pragmáticos de la semántica de la lógica linear
Marcelo Dascal destaca en diversos articulos en los que analiza las consecuencias de la concepcion pragmatica del significado, la… 
2001
2001
Preface: Volume 9
1997
1997
Metatheorems about convertibility in typed lambda calculi : applications to CPS transform and "free theorems"
In this thesis we present two applications of using types of a typed lambda calculus to derive equation schemas, instances of… 
1990
1990
ML Typability is DEXTIME-Complete
We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)