![]() | ![]() |
LMU München
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
2009 | ||
---|---|---|
79 | EE | Ugo Dal Lago, Martin Hofmann: Bounded Linear Logic, Revisited CoRR abs/0904.2675: (2009) |
2008 | ||
78 | Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett: Types, Logics and Semantics for State, 03.02. - 08.02.2008 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 | |
77 | EE | Martin Hofmann, Ulrich Schöpp: Pure Pointer Programs with Iteration. CSL 2008: 79-93 |
76 | EE | Ugo Dal Lago, Martin Hofmann: A Semantic Proof of Polytime Soundness of Light Affine Logic. CSR 2008: 134-145 |
75 | EE | Murdoch James Gabbay, Martin Hofmann: Nominal Renaming Sets. LPAR 2008: 158-173 |
74 | EE | Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin: Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. Pillars of Computer Science 2008: 367-385 |
73 | EE | Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett: 08061 Abstracts Collection -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008 |
72 | EE | Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett: 08061 Executive Summary -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008 |
71 | EE | Ulrich Schöpp, Martin Hofmann: Pointer Programs and Undirected Reachability. Electronic Colloquium on Computational Complexity (ECCC) 15(090): (2008) |
70 | EE | David Aspinall, Martin Hofmann, Michal Konecný: A type system with usage aspects. J. Funct. Program. 18(2): 141-178 (2008) |
2007 | ||
69 | Martin Hofmann, Matthias Felleisen: Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, Nice, France, January 17-19, 2007 ACM 2007 | |
68 | EE | Lennart Beringer, Martin Hofmann: Secure information flow and program logics. CSF 2007: 233-248 |
67 | EE | Lennart Beringer, Martin Hofmann, Mariela Pavlova: Certification Using the Mobius Base Logic. FMCO 2007: 25-51 |
66 | EE | Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann: Relational semantics for effect-based program transformations with dynamic allocation. PPDP 2007: 87-96 |
65 | EE | Martin Hofmann, Mariela Pavlova: Elimination of Ghost Variables in Program Logics. TGC 2007: 1-20 |
64 | EE | David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A program logic for resources. Theor. Comput. Sci. 389(3): 411-445 (2007) |
2006 | ||
63 | EE | Nick Benton, Andrew Kennedy, Martin Hofmann, Lennart Beringer: Reading, Writing and Relations. APLAS 2006: 114-130 |
62 | EE | Lennart Beringer, Martin Hofmann: A Bytecode Logic for JML and Types. APLAS 2006: 389-405 |
61 | EE | Martin Hofmann, Steffen Jost: Type-Based Amortised Heap-Space Analysis. ESOP 2006: 22-37 |
60 | EE | Christian Dax, Martin Hofmann, Martin Lange: A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284 |
59 | EE | Gilles Barthe, Lennart Beringer, Pierre Crégut, Benjamin Grégoire, Martin Hofmann, Peter Müller, Erik Poll, Germán Puebla, Ian Stark, Eric Vétillard: MOBIUS: Mobility, Ubiquity, Security. TGC 2006: 10-29 |
58 | EE | Kevin Hammond, Christian Ferdinand, Reinhold Heckmann, Roy Dyckhoff, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: Towards Formally Verifiable WCET Analysis for a Functional Programming Language. WCET 2006 |
57 | EE | Martin Hofmann, Jaap van Oosten, Thomas Streicher: Well-foundedness in Realizability. Arch. Math. Log. 45(7): 795-805 (2006) |
56 | EE | Anna Bucalo, Furio Honsell, Marino Miculan, Ivan Scagnetto, Martin Hofmann: Consistency of the theory of contexts. J. Funct. Program. 16(3): 327-372 (2006) |
55 | EE | Martin Hofmann, Hans-Wolfgang Loidl: Preface. Theor. Comput. Sci. 364(3): 271-272 (2006) |
2005 | ||
54 | EE | Ugo Dal Lago, Martin Hofmann: Quantitative Models and Implicit Complexity. FSTTCS 2005: 189-200 |
53 | EE | Martin Hofmann: Proof-Theoretic Approach to Description-Logic. LICS 2005: 229-237 |
52 | Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace: The Embounded project (project start paper). Trends in Functional Programming 2005: 195-210 | |
51 | Donald Sannella, Martin Hofmann, David Aspinall, Stephen Gilmore, Ian Stark, Lennart Beringer, Hans-Wolfgang Loidl, Kenneth MacKenzie, Alberto Momigliano, Olha Shkaravska: Mobile Resource Guarantees (project evaluation paper). Trends in Functional Programming 2005: 211-226 | |
50 | EE | Ugo Dal Lago, Martin Hofmann: Quantitative Models and Implicit Complexity CoRR abs/cs/0506079: (2005) |
49 | EE | Martin Hofmann, Pawel Urzyczyn: Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Inform. 65(1-2): (2005) |
2004 | ||
48 | EE | David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, Ian Stark: Mobile Resource Guarantees for Smart Devices. CASSIS 2004: 1-26 |
47 | EE | Martin Hofmann: What Do Program Logics and Type Systems Have in Common? ICALP 2004: 4-7 |
46 | EE | Lennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska: Automatic Certification of Heap Consumption. LPAR 2004: 347-362 |
45 | EE | David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano: A Program Logic for Resource Verification. TPHOLs 2004: 34-49 |
44 | EE | Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher: On the non-sequential nature of the interval-domain model of real-number computation. Mathematical Structures in Computer Science 14(6): 803-814 (2004) |
43 | EE | Martin Hofmann, Philip J. Scott: Realizability models for BLL-like languages. Theor. Comput. Sci. 318(1-2): 121-137 (2004) |
42 | EE | Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg: An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004) |
2003 | ||
41 | Martin Hofmann: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings. Springer 2003 | |
40 | EE | Martin Hofmann: Certification of Memory Usage. ICTCS 2003: 21 |
39 | EE | Martin Hofmann, Steffen Jost: Static prediction of heap space usage for first-order functional programs. POPL 2003: 185-197 |
38 | EE | Martin Hofmann: Linear types and non-size-increasing polynomial time computation. Inf. Comput. 183(1): 57-85 (2003) |
37 | Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann: Preface. Theor. Comput. Sci. 294(1/2): 1 (2003) | |
2002 | ||
36 | EE | David Aspinall, Martin Hofmann: Another Type System for In-Place Update. ESOP 2002: 36-52 |
35 | EE | Martin Hofmann: The strength of non-size increasing computation. POPL 2002: 260-269 |
34 | EE | Martin Hofmann, Benjamin C. Pierce: Type Destructors. Inf. Comput. 172(1): 29-62 (2002) |
33 | EE | Martin Hofmann, Thomas Streicher: Completeness of Continuation Models for lambda-mu-Calculus. Inf. Comput. 179(2): 332-355 (2002) |
32 | Stephen Bellantoni, Martin Hofmann: A New "Feasible" Arithmetic. J. Symb. Log. 67(1): 104-116 (2002) | |
2001 | ||
31 | Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott: Normalization by Evaluation for Typed Lambda Calculus with Coproducts. LICS 2001: 303-310 | |
30 | EE | Martin Hofmann: The Strength of Non-size-increasing Computation (Introduction and Summary). MFCS 2001: 58-61 |
29 | EE | Martin Hofmann: From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. TLCA 2001: 2-3 |
2000 | ||
28 | EE | Martin Hofmann: A Type System for Bounded Space and Functional In-Place Update--Extended Abstract. ESOP 2000: 165-179 |
27 | Martin Hofmann, Francis Tang: Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover. TPHOLs 2000: 268-282 | |
26 | Martin Hofmann: Safe recursion with higher types and BCK-algebra. Ann. Pure Appl. Logic 104(1-3): 113-166 (2000) | |
25 | Martin Hofmann: A Type System for Bounded Space and Functional In-Place Update. Nord. J. Comput. 7(4): 258-289 (2000) | |
1999 | ||
24 | EE | Martin Hofmann: Semantical Analysis of Higher-Order Abstract Syntax. LICS 1999: 204-213 |
23 | EE | Martin Hofmann: Linear Types and Non-Size-Increasing Polynomial Time Computation. LICS 1999: 464-473 |
22 | EE | Martin Hofmann, Giuseppe Rosolini, Dusko Pavlovic: Preface. Electr. Notes Theor. Comput. Sci. 29: (1999) |
21 | Martin Hofmann: Semantics of Linear/Modal Lambda Calculus. J. Funct. Program. 9(3): 247-277 (1999) | |
20 | Thierry Coquand, Martin Hofmann: A new method for establishing conservativity of classical systems over their intuitionistic version. Mathematical Structures in Computer Science 9(4): 323-333 (1999) | |
1998 | ||
19 | Martin Hofmann, Wolfgang Naraschewski, Martin Steffen, Terry Stroup: Inheritance of Proofs. TAPOS 4(1): 51-69 (1998) | |
1997 | ||
18 | Martin Hofmann: A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. CSL 1997: 275-294 | |
17 | EE | Martin Hofmann, Thomas Streicher: Continuation Models are Universal for Lambda-Mu-Calculus. LICS 1997: 387-395 |
16 | EE | Martin Hofmann: An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. Bulletin of Symbolic Logic 3(4): 469-486 (1997) |
1996 | ||
15 | Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Reduction-Free Normalisation for a Polymorphic System. ISTCS 1996: 146 | |
14 | Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Reduction-Free Normalisation for a Polymorphic System. LICS 1996: 98-106 | |
13 | Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. Inf. Comput. 126(1): 11-33 (1996) | |
12 | EE | Martin Hofmann, Donald Sannella: On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic. Theor. Comput. Sci. 167(1&2): 3-45 (1996) |
1995 | ||
11 | Thorsten Altenkirch, Martin Hofmann, Thomas Streicher: Categorical Reconstruction of a Reduction Free Normalization Proof. Category Theory and Computer Science 1995: 182-199 | |
10 | Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. POPL 1995: 186-197 | |
9 | Martin Hofmann, Donald Sannella: On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic. TAPSOFT 1995: 247-261 | |
8 | Martin Hofmann: A Simple Model for Quotient Types. TLCA 1995: 216-234 | |
7 | EE | Martin Hofmann: Conservativity of Equality Reflection over Intensional Type Theory. TYPES 1995: 153-164 |
6 | Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. J. Funct. Program. 5(4): 593-635 (1995) | |
5 | Martin Hofmann: Sound and Complete Axiomatisations of Call-by-Value Control Operators. Mathematical Structures in Computer Science 5(4): 461-482 (1995) | |
1994 | ||
4 | Martin Hofmann: On the Interpretation of Type Theory in Locally Cartesian Closed Categories. CSL 1994: 427-441 | |
3 | Martin Hofmann, Thomas Streicher: The Groupoid Model Refutes Uniqueness of Identity Proofs LICS 1994: 208-212 | |
2 | Martin Hofmann, Benjamin C. Pierce: A Unifying Type-Theoretic Framework for Objects. STACS 1994: 251-262 | |
1993 | ||
1 | Martin Hofmann: Elimination of Extensionality in Martin-Löf Type Theory. TYPES 1993: 166-190 |