Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMartin Hofmann 0001
Person information
- affiliation: LMU Munich, Institute for Informatics
Other persons with the same name
- Martin Hofmann — disambiguation page
- Martin Hofmann 0002 — SAP AG, Walldorf, Germany
- Martin Hofmann 0005 — Forschungszentrum Karlsruhe, Germany
- Martin Hofmann 0006 — Vanderbilt University, Nashville, TN, USA
- Martin Hofmann 0007 — University of Jena, Germany
- Martin Hofmann 0008 — University of Bamberg, Germany
- Martin Hofmann-Apitius
![[0000-0001-9012-6720]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9012-6720")
(aka: Martin Hofmann 0009) — Fraunhofer Institute for Algorithms and Scientific Computing (and 1 more) - Martin Hofmann 0010 — Volkswagen AG
- Martin Hofmann 0011 — TU Munich, Institute for Human-Machine Communication
- Martin Hofmann 0012 — Pädagogische Hochschule des Kantons St.Gallen
- Martin Hofmann 0013 — Institute of Sports Science, University of Magdeburg
- Martin Hofmann 0014 — University of Würzburg, Institute of Mathematics
- Martin Möddel (aka: Martin Hofmann 0016) — University Medical Center Hamburg-Eppendorf, Institute of Biomedical Imaging, Germany
- Martin Hofmann 0017 — Ruhr University Bochum, Germany
- Martin Hofmann 0018 — Braunschweig University of Technology, Germany
- Martin Hofmann 0019 — Technische Universität Ilmenau, Germany
- Martin Hofmann 0020 — University of Applied Sciences Wuerzburg-Schweinfurt, Bad Neustadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i20]Martin Hofmann, Lorenz Leutgeb, Georg Moser, David Obwaller, Florian Zuleger:
Type-Based Analysis of Logarithmic Amortised Complexity. CoRR abs/2101.12029 (2021)
2010 – 2019
- 2018
- [j36]Nick Benton, Martin Hofmann, Vivek Nigam:
Proof-Relevant Logical Relations for Name Generation. Log. Methods Comput. Sci. 14(1) (2018) - [j35]Nick Benton, Martin Hofmann, Vivek Nigam:
Effect-dependent transformations for concurrent programs. Sci. Comput. Program. 155: 27-51 (2018) - [j34]Martin Hofmann, David Aspinall, Brian Campbell, Ian Stark, Perdita Stevens:
Foreword. Theor. Comput. Sci. 741: 1-2 (2018) - [c89]Sabine Bauer, Steffen Jost, Martin Hofmann:
Decidable Inequalities over Infinite Trees. LPAR 2018: 111-130 - [i19]Serdar Erbatur, Martin Hofmann, Eugen Zalinescu:
Enforcing Programming Guidelines with Region Types and Effects. CoRR abs/1801.07647 (2018) - [i18]Sabine Bauer, Martin Hofmann:
Linear Tree Constraints. CoRR abs/1806.09818 (2018) - [i17]Martin Hofmann, Georg Moser:
Analysis of Logarithmic Amortised Complexity. CoRR abs/1807.08242 (2018) - 2017
- [c88]Serdar Erbatur, Martin Hofmann, Eugen Zalinescu:
Enforcing Programming Guidelines with Region Types and Effects. APLAS 2017: 85-104 - [c87]Martin Hofmann, Jérémy Ledent:
A cartesian-closed category for higher-order model checking. LICS 2017: 1-12 - [c86]Sabine Bauer, Martin Hofmann:
Decidable linear list constraints. LPAR 2017: 181-199 - [i16]Nick Benton, Martin Hofmann, Vivek Nigam:
Proof-Relevant Logical Relations for Name Generation. CoRR abs/1708.05193 (2017) - 2016
- [c85]Martin Hofmann:
Modular Edit Lenses. Bidirectional Transformations 2016: 73-99 - [c84]Nick Benton, Andrew Kennedy, Martin Hofmann, Vivek Nigam:
Counting Successes: Effects and Transformations for Non-deterministic Programs. A List of Successes That Can Change the World 2016: 56-72 - [c83]Christoph-Simon Senjak, Martin Hofmann:
An Implementation of Deflate in Coq. FM 2016: 612-627 - [c82]Nick Benton, Martin Hofmann, Vivek Nigam:
Effect-dependent transformations for concurrent programs. PPDP 2016: 188-201 - [c81]Martin Hofmann, Christian Neukirchen, Harald Rueß:
Certification for μ-Calculus with Winning Strategies. SPIN 2016: 111-128 - [i15]Christoph-Simon Senjak, Martin Hofmann:
An implementation of Deflate in Coq. CoRR abs/1609.01220 (2016) - [i14]Andrej Bauer, Martin Hofmann, Matija Pretnar, Jeremy Yallop:
From Theory to Practice of Algebraic Effects and Handlers (Dagstuhl Seminar 16112). Dagstuhl Reports 6(3): 44-58 (2016) - 2015
- [c80]Martin Hofmann:
Logical Relations and Nondeterminism. Software, Services, and Systems 2015: 62-74 - [c79]Martin Hofmann:
Automatic amortized analysis. PPDP 2015: 5 - [c78]Serdar Erbatur, Martin Hofmann:
GuideForce: Type-Based Enforcement of Programming Guidelines. SEFM Workshops 2015: 75-89 - [c77]Martin Hofmann, Georg Moser:
Multivariate Amortised Resource Analysis for Term Rewrite Systems. TLCA 2015: 241-256 - [i13]Nick Benton, Martin Hofmann, Vivek Nigam:
Effect-Dependent Transformations for Concurrent Programs. CoRR abs/1510.02419 (2015) - 2014
- [j33]Pierre-Louis Curien, Richard Garner, Martin Hofmann:
Revisiting the categorical interpretation of dependent type theory. Theor. Comput. Sci. 546: 99-119 (2014) - [c76]Martin Hofmann, Wei Chen:
Abstract interpretation from Büchi automata. CSL-LICS 2014: 51:1-51:10 - [c75]Gordon Cichon, Martin Hofmann:
Formal Semantics of Synchronous Transfer Architecture. Modellierung 2014: 257-272 - [c74]Nick Benton, Martin Hofmann, Vivek Nigam:
Abstract effects and proof-relevant logical relations. POPL 2014: 619-632 - [c73]Martin Hofmann, Georg Moser:
Amortised Resource Analysis and Typed Polynomial Interpretations. RTA-TLCA 2014: 272-286 - [i12]Martin Hofmann, Harald Ruess:
Certification for mu-calculus with winning strategies. CoRR abs/1401.1693 (2014) - [i11]Martin Hofmann, Wei Chen:
Büchi Types for Infinite Traces and Liveness. CoRR abs/1401.5107 (2014) - [i10]Martin Hofmann, Georg Moser:
Amortised Resource Analysis and Typed Polynomial Interpretations (extended version). CoRR abs/1402.1922 (2014) - 2013
- [j32]Lennart Beringer, Robert Grabowski, Martin Hofmann:
Verifying pointer and string analyses with region type systems. Comput. Lang. Syst. Struct. 39(2): 49-65 (2013) - [j31]Martin Hofmann, Benjamin C. Pierce, Daniel Wagner:
Edit languages for information trees. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 57 (2013) - [c72]Martin Hofmann, Dulma Rodriguez:
Automatic Type Inference for Amortised Heap-Space Analysis. ESOP 2013: 593-613 - [c71]Andrej Bauer, Martin Hofmann, Aleksandr Karbyshev:
On Monadic Parametricity of Second-Order Functionals. FoSSaCS 2013: 225-240 - [c70]Martin Hofmann, Ramyaa Ramyaa, Ulrich Schöpp:
Pure Pointer Programs and Tree Isomorphism. FoSSaCS 2013: 321-336 - [c69]Martin Hofmann, Ramyaa:
Computing With a Fixed Number of Pointers (Invited Talk). FSTTCS 2013: 3-18 - [c68]Nick Benton, Martin Hofmann, Vivek Nigam:
Proof-Relevant Logical Relations for Name Generation. TLCA 2013: 48-60 - [i9]Martin Hofmann, Ramyaa Ramyaa:
Power of Nondetreministic JAGs on Cayley graphs. CoRR abs/1310.8317 (2013) - 2012
- [j30]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3): 14:1-14:62 (2012) - [c67]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Resource Aware ML. CAV 2012: 781-786 - [c66]Martin Hofmann, Dulma Rodriguez:
Linear Constraints over Infinite Trees. LPAR 2012: 343-358 - [c65]Martin Hofmann, Benjamin C. Pierce, Daniel Wagner:
Edit lenses. POPL 2012: 495-508 - [c64]Stephan Barth, Martin Hofmann:
Learn with SAT to Minimize Büchi Automata. GandALF 2012: 71-84 - [i8]Nick Benton, Martin Hofmann, Vivek Nigam:
Abstract Effects and Proof-Relevant Logical Relations. CoRR abs/1212.5692 (2012) - 2011
- [b2]Martin Hofmann, Martin Lange:
Automatentheorie und Logik. eXamen.press, Springer 2011, ISBN 978-3-642-18089-7, pp. I-X, 1-240 - [j29]Ugo Dal Lago, Martin Hofmann:
Realizability models and implicit complexity. Theor. Comput. Sci. 412(20): 2029-2047 (2011) - [c63]Robert Grabowski, Martin Hofmann, Keqin Li:
Type-Based Enforcement of Secure Programming Guidelines - Code Injection Prevention at SAP. Formal Aspects in Security and Trust 2011: 182-197 - [c62]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Multivariate amortized resource analysis. POPL 2011: 357-370 - [c61]Martin Hofmann, Benjamin C. Pierce, Daniel Wagner:
Symmetric lenses. POPL 2011: 371-384 - [e8]Martin Hofmann:
Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings. Lecture Notes in Computer Science 6604, Springer 2011, ISBN 978-3-642-19804-5 [contents] - 2010
- [j28]Ugo Dal Lago, Martin Hofmann:
Bounded Linear Logic, Revisited. Log. Methods Comput. Sci. 6(4) (2010) - [j27]Ugo Dal Lago, Martin Hofmann:
A Semantic Proof of Polytime Soundness of Light Affine Logic. Theory Comput. Syst. 46(4): 673-689 (2010) - [j26]Martin Hofmann, Ulrich Schöpp:
Pure pointer programs with iteration. ACM Trans. Comput. Log. 11(4): 26:1-26:23 (2010) - [c60]Jan Hoffmann, Martin Hofmann:
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics. APLAS 2010: 172-187 - [c59]Jan Hoffmann, Martin Hofmann:
Amortized Resource Analysis with Polynomial Potential. ESOP 2010: 287-306 - [c58]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
What Is a Pure Functional? ICALP (2) 2010: 199-210 - [c57]Lennart Beringer, Robert Grabowski, Martin Hofmann:
Verifying Pointer and String Analyses with Region Type Systems. LPAR (Dakar) 2010: 82-102 - [c56]Steffen Jost, Kevin Hammond, Hans-Wolfgang Loidl, Martin Hofmann:
Static determination of quantitative resource usage for higher-order programs. POPL 2010: 223-236 - [c55]Patrick Baillot, Martin Hofmann:
Type inference in intuitionistic linear logic. PPDP 2010: 219-230 - [c54]Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
Verifying a Local Generic Solver in Coq. SAS 2010: 340-355 - [e7]Amal Ahmed, Nick Benton, Lars Birkedal, Martin Hofmann:
Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010. Dagstuhl Seminar Proceedings 10351, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [e6]Martin Wirsing, Martin Hofmann, Axel Rauschmayer:
Trustworthly Global Computing - 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6084, Springer 2010, ISBN 978-3-642-15639-7 [contents] - [i7]Amal Ahmed, Nick Benton, Lars Birkedal, Martin Hofmann:
10351 Abstracts Collection - Modelling, Controlling and Reasoning About State. Modelling, Controlling and Reasoning About State 2010 - [i6]Amal Ahmed, Nick Benton, Lars Birkedal, Martin Hofmann:
10351 Executive Summary - Modelling, Controlling and Reasoning About State. Modelling, Controlling and Reasoning About State 2010
2000 – 2009
- 2009
- [c53]Martin Hofmann, Dulma Rodriguez:
Efficient Type-Checking for Amortised Heap-Space Analysis. CSL 2009: 317-331 - [c52]Martin Hofmann, Dulma Rodriguez:
Membership Checking in Greatest Fixpoints Revisited. FICS 2009: 46-53 - [c51]Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, Norman Scaife, Martin Hofmann:
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis. FM 2009: 354-369 - [c50]Martin Hofmann, Ulrich Schöpp:
Pointer Programs and Undirected Reachability. LICS 2009: 133-142 - [c49]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann:
Relational semantics for effect-based program transformations: higher-order store. PPDP 2009: 301-312 - [c48]Ugo Dal Lago, Martin Hofmann:
Bounded Linear Logic, Revisited. TLCA 2009: 80-94 - 2008
- [d2]Lennart Beringer, Martin Hofmann:
Secure information flow and program logics. Arch. Formal Proofs 2008 (2008) - [d1]Lennart Beringer, Martin Hofmann:
A Bytecode Logic for JML and Types. Arch. Formal Proofs 2008 (2008) - [j25]David Aspinall, Martin Hofmann, Michal Konecný:
A type system with usage aspects. J. Funct. Program. 18(2): 141-178 (2008) - [c47]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 - [c46]Martin Hofmann, Ulrich Schöpp:
Pure Pointer Programs with Iteration. CSL 2008: 79-93 - [c45]Ugo Dal Lago, Martin Hofmann:
A Semantic Proof of Polytime Soundness of Light Affine Logic. CSR 2008: 134-145 - [c44]Murdoch James Gabbay, Martin Hofmann:
Nominal Renaming Sets. LPAR 2008: 158-173 - [e5]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett:
Types, Logics and Semantics for State, 03.02. - 08.02.2008. Dagstuhl Seminar Proceedings 08061, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [i5]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett:
08061 Executive Summary -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008 - [i4]Amal Ahmed, Nick Benton, Martin Hofmann, Greg Morrisett:
08061 Abstracts Collection -- Types, Logics and Semantics for State. Types, Logics and Semantics for State 2008 - [i3]Ulrich Schöpp, Martin Hofmann:
Pointer Programs and Undirected Reachability. Electron. Colloquium Comput. Complex. 15(090) (2008) - 2007
- [j24]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano:
A program logic for resources. Theor. Comput. Sci. 389(3): 411-445 (2007) - [c43]Lennart Beringer, Martin Hofmann:
Secure information flow and program logics. CSF 2007: 233-248 - [c42]Lennart Beringer, Martin Hofmann, Mariela Pavlova:
Certification Using the Mobius Base Logic. FMCO 2007: 25-51 - [c41]Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann:
Relational semantics for effect-based program transformations with dynamic allocation. PPDP 2007: 87-96 - [c40]Martin Hofmann, Mariela Pavlova:
Elimination of Ghost Variables in Program Logics. TGC 2007: 1-20 - [e4]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, ISBN 1-59593-575-4 [contents] - 2006
- [j23]Martin Hofmann, Jaap van Oosten, Thomas Streicher:
Well-foundedness in Realizability. Arch. Math. Log. 45(7): 795-805 (2006) - [j22]Anna Bucalo, Furio Honsell, Marino Miculan, Ivan Scagnetto, Martin Hofmann:
Consistency of the theory of contexts. J. Funct. Program. 16(3): 327-372 (2006) - [j21]Martin Hofmann, Hans-Wolfgang Loidl:
Preface. Theor. Comput. Sci. 364(3): 271-272 (2006) - [c39]Nick Benton, Andrew Kennedy, Martin Hofmann, Lennart Beringer:
Reading, Writing and Relations. APLAS 2006: 114-130 - [c38]Lennart Beringer, Martin Hofmann:
A Bytecode Logic for JML and Types. APLAS 2006: 389-405 - [c37]Martin Hofmann, Steffen Jost:
Type-Based Amortised Heap-Space Analysis. ESOP 2006: 22-37 - [c36]Christian Dax, Martin Hofmann, Martin Lange:
A Proof System for the Linear Time µ-Calculus. FSTTCS 2006: 273-284 - [c35]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 - [c34]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 - 2005
- [j20]Martin Hofmann, Pawel Urzyczyn:
Typed Lambda Calculi and Applications 2003, Selected Papers. Fundam. Informaticae 65(1-2) (2005) - [c33]Ugo Dal Lago, Martin Hofmann:
Quantitative Models and Implicit Complexity. FSTTCS 2005: 189-200 - [c32]Martin Hofmann:
Proof-Theoretic Approach to Description-Logic. LICS 2005: 229-237 - [c31]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 - [c30]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 - [i2]Ugo Dal Lago, Martin Hofmann:
Quantitative Models and Implicit Complexity. CoRR abs/cs/0506079 (2005) - 2004
- [j19]Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher:
On the non-sequential nature of the interval-domain model of real-number computation. Math. Struct. Comput. Sci. 14(6): 803-814 (2004) - [j18]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) - [j17]Martin Hofmann, Philip J. Scott:
Realizability models for BLL-like languages. Theor. Comput. Sci. 318(1-2): 121-137 (2004) - [c29]David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, Ian Stark:
Mobile Resource Guarantees for Smart Devices. CASSIS 2004: 1-26 - [c28]Martin Hofmann:
What Do Program Logics and Type Systems Have in Common? ICALP 2004: 4-7 - [c27]Lennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska:
Automatic Certification of Heap Consumption. LPAR 2004: 347-362 - [c26]David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano:
A Program Logic for Resource Verification. TPHOLs 2004: 34-49 - [e3]Thorsten Altenkirch, Martin Hofmann, John Hughes:
Dependently Typed Programming, 12.09. - 17.09.2004. Dagstuhl Seminar Proceedings 04381, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents] - [i1]Thorsten Altenkirch, Martin Hofmann, John Hughes:
04381 Abstracts Collection - Dependently Typed Programming. Dependently Typed Programming 2004 - 2003
- [j16]Martin Hofmann:
Linear types and non-size-increasing polynomial time computation. Inf. Comput. 183(1): 57-85 (2003) - [j15]Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann:
Preface. Theor. Comput. Sci. 294(1/2): 1 (2003) - [c25]Martin Hofmann:
Certification of Memory Usage. ICTCS 2003: 21 - [c24]Martin Hofmann, Steffen Jost:
Static prediction of heap space usage for first-order functional programs. POPL 2003: 185-197 - [e2]Martin Hofmann:
Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings. Lecture Notes in Computer Science 2701, Springer 2003, ISBN 3-540-40332-9 [contents] - 2002
- [j14]Martin Hofmann, Benjamin C. Pierce:
Type Destructors. Inf. Comput. 172(1): 29-62 (2002) - [j13]Martin Hofmann, Thomas Streicher:
Completeness of Continuation Models for lambda-mu-Calculus. Inf. Comput. 179(2): 332-355 (2002) - [j12]Stephen Bellantoni, Martin Hofmann:
A New "Feasible" Arithmetic. J. Symb. Log. 67(1): 104-116 (2002) - [c23]David Aspinall, Martin Hofmann:
Another Type System for In-Place Update. ESOP 2002: 36-52 - [c22]Martin Hofmann:
The strength of non-size increasing computation. POPL 2002: 260-269 - 2001
- [c21]Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott:
Normalization by Evaluation for Typed Lambda Calculus with Coproducts. LICS 2001: 303-310 - [c20]Martin Hofmann:
The Strength of Non-size-increasing Computation (Introduction and Summary). MFCS 2001: 58-61 - [c19]Martin Hofmann:
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. TLCA 2001: 2-3 - 2000
- [j11]Martin Hofmann:
Safe recursion with higher types and BCK-algebra. Ann. Pure Appl. Log. 104(1-3): 113-166 (2000) - [j10]Martin Hofmann:
A Type System for Bounded Space and Functional In-Place Update. Nord. J. Comput. 7(4): 258-289 (2000) - [j9]Martin Hofmann:
Programming languages capturing complexity classes. SIGACT News 31(1): 31-42 (2000) - [c18]Martin Hofmann:
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract. ESOP 2000: 165-179 - [c17]Martin Hofmann, Francis Tang:
Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover. TPHOLs 2000: 268-282
1990 – 1999
- 1999
- [j8]Martin Hofmann:
Semantics of Linear/Modal Lambda Calculus. J. Funct. Program. 9(3): 247-277 (1999) - [j7]Thierry Coquand, Martin Hofmann:
A new method for establishing conservativity of classical systems over their intuitionistic version. Math. Struct. Comput. Sci. 9(4): 323-333 (1999) - [c16]Martin Hofmann:
Semantical Analysis of Higher-Order Abstract Syntax. LICS 1999: 204-213 - [c15]Martin Hofmann:
Linear Types and Non-Size-Increasing Polynomial Time Computation. LICS 1999: 464-473 - [c14]Martin Hofmann, Giuseppe Rosolini, Dusko Pavlovic:
Preface. CTCS 1999: 1 - [e1]Martin Hofmann, Giuseppe Rosolini, Dusko Pavlovic:
Conference on Category Theory and Computer Science, CTCS 1999, Edinburgh, UK, December 10-12, 1999. Electronic Notes in Theoretical Computer Science 29, Elsevier 1999 [contents] - 1998
- [j6]Martin Hofmann, Wolfgang Naraschewski, Martin Steffen, Terry Stroup:
Inheritance of Proofs. Theory Pract. Object Syst. 4(1): 51-69 (1998) - 1997
- [b1]