#### Filter Results:

- Full text PDF available (129)

#### Publication Year

1993

2016

- This year (0)
- Last 5 years (32)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Martin Hofmann
- 1996

- Martin Hofmann, Steffen Jost
- POPL
- 2003

We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs.The analysis takes space reuse by explicit deallocation into account and also furnishes an upper bound on the heap usage in the presence of garbage collection. It covers a wide variety of examples including, for instance, the familiar… (More)

- Martin Hofmann
- Inf. Comput.
- 1999

We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are polynomial time computable. The system improves upon previous such systems in that recursive definitions can be arbitrarily nested; in particular, no predicativity or modality restrictions are made.

- Jan Hoffmann, Klaus Aehlig, Martin Hofmann
- ACM Trans. Program. Lang. Syst.
- 2011

We study the problem of automatically analyzing the worst-case resource usage of procedures with several arguments. Existing automatic analyses based on amortization or sized types bound the resource usage or result size of such a procedure by a sum of unary functions of the sizes of the arguments.
In this article we generalize this to arbitrary… (More)

- Martin Hofmann
- Nord. J. Comput.
- 2000

We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a " design pattern " for writing C-code in a functional style and as a compilation process from linearly typed first-order functional programs into malloc()-free C code. The main technical result is the… (More)

- Masahito Hasegawa, Martin Hofmann, Gordon D. Plotkin
- Pillars of Computer Science
- 2008

We show that the category FinVect k of finite dimensional vector spaces and linear maps over any field k is (collectively) complete for the traced symmetric monoidal category freely generated from a signature , provided that the field has characteristic 0; this means that for any two different arrows in the free traced category there always exists a strong… (More)

We describe a new <i>automatic </i> static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs dealing with possibly-aliased data. Our analysis is a variant of Tarjan's manual <i>amortised cost analysis </i> technique. We use a type-based approach, exploiting linearity… (More)

- Martin Hofmann, Benjamin C. Pierce, Daniel Wagner
- POPL
- 2011

<i>Lenses</i>--bidirectional transformations between pairs of connected structures--have been extensively studied and are beginning to find their way into industrial practice. However, some aspects of their foundations remain poorly understood. In particular, most previous work has focused on the special case of <i>asymmetric lenses</i>, where one of the… (More)

- Martin Hofmann
- CSL
- 1997

This paper introduces a simply-typed lambda calculus with both modal and linear function types. Through the use of subtyping extra term formers associated with modality and linearity are avoided. We study the basic metatheory of this system including existence and inference of principal types. The system serves as a platform for certain higher-order… (More)

- Christian Dax, Martin Hofmann, Martin Lange
- FSTTCS
- 2006

The linear time µ-calculus extends LTL with arbitrary least and greatest fixpoint operators. This gives it the power to express all ω-regular languages, i.e. strictly more than LTL. The validity problem is PSPACE-complete for both LTL and the linear time µ-calculus. In practice it is more difficult for the latter because of nestings of fixpoint operators… (More)