bibliographer - Harry G. Mairson

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Deciding kCFA is Complete for EXPTIME David Van Horn Harry G. Mairson [github]

The complexity of type inference for higher-order lambda calculi Fritz Henglein Harry G. Mairson [github]

Unification and ML Type Reconstruction Paris C. Kanellakis Harry G. Mairson John C. Mitchell [github]

Relating typability and expressiveness in finite-rank intersection type systems (extended abstract) Assaf J. Kfoury Harry G. Mairson Franklyn A. Turbak J. B. Wells [github]

Types, potency, and idempotency: why nonlinearity and amnesia make a type system work Peter Møller Neergaard Harry G. Mairson [github]

From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple Harry G. Mairson [github]

Deciding ML typability is complete for deterministic exponential time Harry G. Mairson [github]

Relating complexity and precision in control flow analysis David Van Horn Harry G. Mairson [github]

Flow Analysis, Linearity, and PTIME David Van Horn Harry G. Mairson [github]

A simple proof of a theorem of Statman Harry G. Mairson [github]

Database Query Languages Embedded in the Typed Lambda Calculus Gerd G. Hillebrand Paris C. Kanellakis Harry G. Mairson [github]

Types, potency, and idempotency Peter Møller Neergaard Harry G. Mairson [github]

Library Size: 13G (12 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]