Martin Hofmann
TitleCited byYear
Static prediction of heap space usage for first-order functional programs
M Hofmann, S Jost
ACM SIGPLAN Notices 38 (1), 185-197, 2003
3762003
The groupoid interpretation of type theory
M Hofmann, T Streicher
Twenty-five years of constructive type theory (Venice, 1995) 36, 83-111, 1998
2861998
Linear types and non-size-increasing polynomial time computation
M Hofmann
Information and Computation 183 (1), 57-85, 2003
2442003
Syntax and semantics of dependent types
M Hofmann
Extensional Constructs in Intensional Type Theory, 13-54, 1997
2211997
Semantical analysis of higher-order abstract syntax
M Hofmann
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
2201999
Extensional concepts in intensional type theory
M Hofmann
University of Edinburgh. College of Science and Engineering. School of …, 1995
2071995
A type system for bounded space and functional in-place update
M Hofmann
European Symposium on Programming, 165-179, 2000
1802000
Type-based amortised heap-space analysis
M Hofmann, S Jost
European Symposium on Programming, 22-37, 2006
1462006
On the interpretation of type theory in locally cartesian closed categories
M Hofmann
International Workshop on Computer Science Logic, 427-441, 1994
1311994
Static determination of quantitative resource usage for higher-order programs
S Jost, K Hammond, HW Loidl, M Hofmann
ACM Sigplan Notices 45 (1), 223-236, 2010
1282010
Symmetric lenses
M Hofmann, B Pierce, D Wagner
ACM SIGPLAN Notices 46 (1), 371-384, 2011
1272011
Multivariate amortized resource analysis
J Hoffmann, K Aehlig, M Hofmann
ACM SIGPLAN Notices 46 (1), 357-370, 2011
1232011
Multivariate amortized resource analysis
J Hoffmann, K Aehlig, M Hofmann
ACM Transactions on Programming Languages and Systems (TOPLAS) 34 (3), 14, 2012
1092012
Amortized resource analysis with polynomial potential
J Hoffmann, M Hofmann
European Symposium on Programming, 287-306, 2010
1042010
The groupoid model refutes uniqueness of identity proofs
M Hofmann, T Streicher
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 208-212, 1994
1011994
Categorical reconstruction of a reduction free normalization proof
T Altenkirch, M Hofmann, T Streicher
International Conference on Category Theory and Computer Science, 182-199, 1995
961995
A unifying type-theoretic framework for objects
M Hofmann, B Pierce
Journal of Functional Programming 5 (4), 593-635, 1995
951995
Continuation models are universal for/spl lambda//sub/spl mu//-calculus
M Hofmann, T Streicher
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997
941997
Normalization by evaluation for typed lambda calculus with coproducts
T Altenkirch, P Dybjer, M Hofmann, P Scott
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 303-310, 2001
912001
Mobile resource guarantees for smart devices
D Aspinall, S Gilmore, M Hofmann, D Sannella, I Stark
International Workshop on Construction and Analysis of Safe, Secure, and …, 2004
812004
The system can't perform the operation now. Try again later.
Articles 1–20