#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2002

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ulrich Schöpp, Ian Stark
- CSL
- 2004

We consider the problem of providing formal support for working with abstract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set theory how to address this through first-class names: in this paper we present a dependent type theory for programming and reasoning with such names. Our development is… (More)

- Ulrich Schöpp
- 2006

Names and name-binding are useful concepts in the theory and practice of formal systems. In this thesis we study them in the context of dependent type theory. We propose a novel dependent type theory with primitives for the explicit handling of names. As the main application, we consider programming and reasoning with abstract syntax involving variable… (More)

- Ulrich Schöpp, Alex K. Simpson
- FoSSaCS
- 2002

We present a sequent calculus for formally verifying modal μ-calculus properties of concurrent processes. Building on work by Dam and Gurov, the proof system contains rules for the explicit manipulation of fixed-point approximants. We develop a new syntax for approximants, incorporating, in particular, modalities for approximant modification. We make… (More)

- Ulrich Schöpp, Martin Hofmann
- 2009 24th Annual IEEE Symposium on Logic In…
- 2008

Pointer programs are a model of structured computation within LOGSPACE. They capture the common description of LOGSPACE algorithms as programs that take as input some structured data (e.g. a graph) and that store in memory only a constant number of pointers to the input (e.g. to the graph nodes). In this paper we study undirected s-t-reachability for a… (More)

- Ulrich Schöpp
- 22nd Annual IEEE Symposium on Logic in Computer…
- 2007

A number of complexity classes, most notably PTIME, have been characterised by sub-systems of linear logic. In this paper we show that the functions computable in logarithmic space can also be characterised by a restricted version of linear logic. We introduce stratified bounded affine logic (SBAL), a restricted version of bounded linear logic, in which not… (More)

- Ugo Dal Lago, Ulrich Schöpp
- ESOP
- 2010

We consider the problem of functional programming with data in external memory, in particular as it appears in sublinear space computation. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot compose functions directly for lack of space for the intermediate result,… (More)

- Ulrich Schöpp
- PPDP
- 2014

Type systems that allow control over low-level compilation details have been developed in the context of resource aware compilation, e.g. for circuit synthesis or for programming with logarithmic space. It was recently observed that some compilation techniques developed in this context, while motivated by capturing certain resource usage restrictions, are… (More)

- Ulrich Schöpp
- Electr. Notes Theor. Comput. Sci.
- 2007

We propose a semantics for the ∇-quantifier of Miller and Tiu. First we consider the case for classical first-order logic. In this case, the interpretation is close to standard Tarski-semantics and completeness can be shown using a standard argument. Then we put our semantics into a broader context by giving a general interpretation of ∇ in categories with… (More)

- Ulrich Schöpp
- APLAS
- 2015

We study the efficient implementation of call-by-value using the structure of interactive computation models. This structure has been useful in applications to resource-bounded compilation, but much of the existing work in this area has focused on call-by-name programming languages. This paper works towards the goal of a simple, efficient treatment of… (More)

- Ugo Dal Lago, Ulrich Schöpp
- APLAS
- 2010

We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming language with primitives that support the implementation of such algorithms. We have shown that IntML can express all LOGSPACE functions but have left open the question how easy it is… (More)