Harry G. Mairson

Brandeis University, Waltham, MA, United States 
Computer Science
"Harry Mairson"
BETA: Related publications


You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Mairson HG. (2004) Linear lambda calculus and PTIME-completeness Journal of Functional Programming. 14: 623-633
Asperti A, Mairson HG. (2001) Parallel beta reduction is not elementary recursive Information and Computation. 170: 49-80
Mairson H. (2000) Programming language foundations of computation theory Acm Sigsoft Software Engineering Notes. 25: 63
Mairson H, Kapron B. (1997) CALL FOR PAPERS: Special Issue on Functional Programming and Computational Complexity Journal of Functional Programming. 7: 355-356
Mairson HG. (1996) Complexity-theoretic aspects of programming language design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1118: 572
Hillebrand GG, Kanellakis PC, Mairson HG, et al. (1995) Undecidable boundedness problems for datalog programs The Journal of Logic Programming. 25: 163-190
Hengleini F, Mairson HG. (1994) The complexity of type inference for higherorder typed lambda calculf Journal of Functional Programming. 4: 435-477
Gaifman H, Mairson H, Sagiv Y, et al. (1993) Undecidable optimization problems for database logic programs Journal of the Acm. 40: 683-713
Mairson HG. (1992) Quantifier elimination and parametric polymorphism in programming languages Journal of Functional Programming. 2: 213-226
Mairson HG. (1992) A simple proof of a theorem of Statman Theoretical Computer Science. 103: 387-394
See more...