The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Hofmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nick Benton, Andrew Kennedy, Martin Hofmann, Lennart Beringer
    Reading, Writing and Relations. [Citation Graph (0, 0)][DBLP]
    APLAS, 2006, pp:114-130 [Conf]
  2. Lennart Beringer, Martin Hofmann
    A Bytecode Logic for JML and Types. [Citation Graph (0, 0)][DBLP]
    APLAS, 2006, pp:389-405 [Conf]
  3. David Aspinall, Stephen Gilmore, Martin Hofmann, Donald Sannella, Ian Stark
    Mobile Resource Guarantees for Smart Devices. [Citation Graph (0, 0)][DBLP]
    CASSIS, 2004, pp:1-26 [Conf]
  4. Martin Hofmann
    On the Interpretation of Type Theory in Locally Cartesian Closed Categories. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:427-441 [Conf]
  5. Martin Hofmann
    A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:275-294 [Conf]
  6. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Categorical Reconstruction of a Reduction Free Normalization Proof. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1995, pp:182-199 [Conf]
  7. David Aspinall, Martin Hofmann
    Another Type System for In-Place Update. [Citation Graph (0, 0)][DBLP]
    ESOP, 2002, pp:36-52 [Conf]
  8. Martin Hofmann
    A Type System for Bounded Space and Functional In-Place Update--Extended Abstract. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:165-179 [Conf]
  9. Martin Hofmann, Steffen Jost
    Type-Based Amortised Heap-Space Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2006, pp:22-37 [Conf]
  10. Christian Dax, Martin Hofmann, Martin Lange
    A Proof System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:273-284 [Conf]
  11. Ugo Dal Lago, Martin Hofmann
    Quantitative Models and Implicit Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:189-200 [Conf]
  12. Martin Hofmann
    What Do Program Logics and Type Systems Have in Common? [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:4-7 [Conf]
  13. Martin Hofmann
    Certification of Memory Usage. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:21- [Conf]
  14. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:146- [Conf]
  15. Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott
    Normalization by Evaluation for Typed Lambda Calculus with Coproducts. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:303-310 [Conf]
  16. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:98-106 [Conf]
  17. Martin Hofmann
    Proof-Theoretic Approach to Description-Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:229-237 [Conf]
  18. Martin Hofmann
    Semantical Analysis of Higher-Order Abstract Syntax. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:204-213 [Conf]
  19. Martin Hofmann
    Linear Types and Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:464-473 [Conf]
  20. Martin Hofmann, Thomas Streicher
    The Groupoid Model Refutes Uniqueness of Identity Proofs [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:208-212 [Conf]
  21. Martin Hofmann, Thomas Streicher
    Continuation Models are Universal for Lambda-Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:387-395 [Conf]
  22. Lennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska
    Automatic Certification of Heap Consumption. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:347-362 [Conf]
  23. Martin Hofmann
    The Strength of Non-size-increasing Computation (Introduction and Summary). [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:58-61 [Conf]
  24. Martin Hofmann
    The strength of non-size increasing computation. [Citation Graph (0, 0)][DBLP]
    POPL, 2002, pp:260-269 [Conf]
  25. Martin Hofmann, Steffen Jost
    Static prediction of heap space usage for first-order functional programs. [Citation Graph (0, 0)][DBLP]
    POPL, 2003, pp:185-197 [Conf]
  26. Martin Hofmann, Benjamin C. Pierce
    Positive Subtyping. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:186-197 [Conf]
  27. Martin Hofmann, Benjamin C. Pierce
    A Unifying Type-Theoretic Framework for Objects. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:251-262 [Conf]
  28. Martin Hofmann, Donald Sannella
    On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1995, pp:247-261 [Conf]
  29. Martin Hofmann
    From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:2-3 [Conf]
  30. Martin Hofmann
    A Simple Model for Quotient Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 1995, pp:216-234 [Conf]
  31. David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano
    A Program Logic for Resource Verification. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2004, pp:34-49 [Conf]
  32. Martin Hofmann, Francis Tang
    Implementing a Program Logic of Objects in a Higher-Order Logic Theorem Prover. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2000, pp:268-282 [Conf]
  33. Martin Hofmann
    Elimination of Extensionality in Martin-Löf Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 1993, pp:166-190 [Conf]
  34. Martin Hofmann
    Conservativity of Equality Reflection over Intensional Type Theory. [Citation Graph (0, 0)][DBLP]
    TYPES, 1995, pp:153-164 [Conf]
  35. Martin Hofmann, Jaap van Oosten, Thomas Streicher
    Well-foundedness in Realizability. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:7, pp:795-805 [Journal]
  36. Martin Hofmann
    Safe recursion with higher types and BCK-algebra. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:113-166 [Journal]
  37. Martin Hofmann
    An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1997, v:3, n:4, pp:469-486 [Journal]
  38. Martin Hofmann, Pawel Urzyczyn
    Typed Lambda Calculi and Applications 2003, Selected Papers. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:65, n:1-2, pp:- [Journal]
  39. Martin Hofmann
    Linear types and non-size-increasing polynomial time computation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:57-85 [Journal]
  40. Martin Hofmann, Benjamin C. Pierce
    Type Destructors. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:172, n:1, pp:29-62 [Journal]
  41. Martin Hofmann, Benjamin C. Pierce
    Positive Subtyping. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:1, pp:11-33 [Journal]
  42. Martin Hofmann, Thomas Streicher
    Completeness of Continuation Models for lambda-mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:332-355 [Journal]
  43. Martin Hofmann
    Semantics of Linear/Modal Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1999, v:9, n:3, pp:247-277 [Journal]
  44. Martin Hofmann, Benjamin C. Pierce
    A Unifying Type-Theoretic Framework for Objects. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1995, v:5, n:4, pp:593-635 [Journal]
  45. Stephen Bellantoni, Martin Hofmann
    A New "Feasible" Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:1, pp:104-116 [Journal]
  46. Thierry Coquand, Martin Hofmann
    A new method for establishing conservativity of classical systems over their intuitionistic version. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1999, v:9, n:4, pp:323-333 [Journal]
  47. Martín Hötzel Escardó, Martin Hofmann, Thomas Streicher
    On the non-sequential nature of the interval-domain model of real-number computation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:6, pp:803-814 [Journal]
  48. Martin Hofmann
    Sound and Complete Axiomatisations of Call-by-Value Control Operators. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1995, v:5, n:4, pp:461-482 [Journal]
  49. Martin Hofmann
    A Type System for Bounded Space and Functional In-Place Update. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:4, pp:258-289 [Journal]
  50. Martin Hofmann, Wolfgang Naraschewski, Martin Steffen, Terry Stroup
    Inheritance of Proofs. [Citation Graph (0, 0)][DBLP]
    TAPOS, 1998, v:4, n:1, pp:51-69 [Journal]
  51. Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:1- [Journal]
  52. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
    An arithmetic for non-size-increasing polynomial-time computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:3-27 [Journal]
  53. Martin Hofmann, Hans-Wolfgang Loidl
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:3, pp:271-272 [Journal]
  54. Martin Hofmann, Giuseppe Rosolini, Dusko Pavlovic
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:29, n:, pp:- [Journal]
  55. Martin Hofmann, Philip J. Scott
    Realizability models for BLL-like languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:121-137 [Journal]
  56. Martin Hofmann, Donald Sannella
    On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:167, n:1&2, pp:3-45 [Journal]
  57. Nick Benton, Andrew Kennedy, Lennart Beringer, Martin Hofmann
    Relational semantics for effect-based program transformations with dynamic allocation. [Citation Graph (0, 0)][DBLP]
    PPDP, 2007, pp:87-96 [Conf]
  58. 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). [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:211-226 [Conf]
  59. 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). [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:195-210 [Conf]

  60. Finite Dimensional Vector Spaces Are Complete for Traced Symmetric Monoidal Categories. [Citation Graph (, )][DBLP]


  61. Secure information flow and program logics. [Citation Graph (, )][DBLP]


  62. Pure Pointer Programs with Iteration. [Citation Graph (, )][DBLP]


  63. Efficient Type-Checking for Amortised Heap-Space Analysis. [Citation Graph (, )][DBLP]


  64. A Semantic Proof of Polytime Soundness of Light Affine Logic. [Citation Graph (, )][DBLP]


  65. 08061 Executive Summary -- Types, Logics and Semantics for State. [Citation Graph (, )][DBLP]


  66. 08061 Abstracts Collection -- Types, Logics and Semantics for State. [Citation Graph (, )][DBLP]


  67. Amortized Resource Analysis with Polynomial Potential. [Citation Graph (, )][DBLP]


  68. "Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis. [Citation Graph (, )][DBLP]


  69. Certification Using the Mobius Base Logic. [Citation Graph (, )][DBLP]


  70. What Is a Pure Functional? [Citation Graph (, )][DBLP]


  71. Pointer Programs and Undirected Reachability. [Citation Graph (, )][DBLP]


  72. Nominal Renaming Sets. [Citation Graph (, )][DBLP]


  73. Static determination of quantitative resource usage for higher-order programs. [Citation Graph (, )][DBLP]


  74. Type inference in intuitionistic linear logic. [Citation Graph (, )][DBLP]


  75. Relational semantics for effect-based program transformations: higher-order store. [Citation Graph (, )][DBLP]


  76. Verifying a Local Generic Solver in Coq. [Citation Graph (, )][DBLP]


  77. Elimination of Ghost Variables in Program Logics. [Citation Graph (, )][DBLP]


  78. MOBIUS: Mobility, Ubiquity, Security. [Citation Graph (, )][DBLP]


  79. Bounded Linear Logic, Revisited. [Citation Graph (, )][DBLP]


  80. Towards Formally Verifiable WCET Analysis for a Functional Programming Language. [Citation Graph (, )][DBLP]


  81. Automated Method Induction: Functional Goes Object Oriented. [Citation Graph (, )][DBLP]


  82. Quantitative Models and Implicit Complexity [Citation Graph (, )][DBLP]


  83. Bounded Linear Logic, Revisited [Citation Graph (, )][DBLP]


  84. Pointer Programs and Undirected Reachability. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.040secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002