#### Filter Results:

- Full text PDF available (56)

#### Publication Year

1996

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- David Aspinall, Christoph Lüth, Daniel Winterstein
- Calculemus/MKM
- 2007

This paper introduces a software framework for conducting interactive proof, dubbed the Proof General Kit. It defines a component infrastructure, the syntax of messages exchanged between components, and the protocol governing message exchanges. The infrastructure connects provers to one or more display components for interacting with the user, such as the… (More)

- Holger Täubig, Udo Frese, +4 authors Dennis Walter
- Auton. Robots
- 2012

When autonomous robots begin to share the human living and working spaces, safety becomes paramount. It is legally required that the safety of such systems is ensured, e. g. by certification according to relevant standards such as IEC 61508. However, such safety considerations are usually not addressed in academic robotics. In this paper we report on one… (More)

- David Aspinall, Christoph Lüth, Burkhart Wolff
- MKM
- 2005

Recently, significant advances have been made in formalised mathematical texts for large, demanding proofs. But although such large developments are possible, they still take an inordinate amount of effort and time, and there is a significant gap between the resulting formalised machine-checkable proof scripts and the corresponding human-readable… (More)

- Christoph Lüth, Neil Ghani
- ICFP
- 2002

Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential to provide both a modular semantics and a modular programming style was soon recognised. However, in general, monads proved difficult to compose and so research focused on special… (More)

- Neil Ghani, Christoph Lüth
- Nord. J. Comput.
- 2003

This paper introduces a semantics for rewriting that is independent of the data being rewritten and which, nevertheless, models key concepts such as substitution which are central to rewriting algorithms. We demonstrate the naturalness of this construction by showing how it mirrors the usual treatment of algebraic theories as coequalizers of monads. We also… (More)

- Neil Ghani, Christoph Lüth, Federico De Marchi, John Power
- Mathematical Structures in Computer Science
- 2003

Whilst the relationship between initial algebras and monads is well understood, the relationship between final coalgebras and comonads is less well explored. This paper shows that the problem is more subtle than might appear at first glance: final coalgebras can form monads just as easily as comonads, and, dually, initial algebras form both monads and… (More)

- Federico De Marchi, Neil Ghani, Christoph Lüth
- ITA
- 2003

Algebraic systems of equations define functions using recursion where parameter passing is permitted. This generalizes the notion of a rational system of equations where parameter passing is prohibited. It has been known for some time that algebraic systems in Greibach Normal Form have unique solutions. This paper presents a categorical approach to… (More)

- David Aspinall, Ewen Denney, Christoph Lüth
- AISC/MKM/Calculemus
- 2008

We introduce and study a tactic language, Hitac, for constructing hierarchical proofs, known as hiproofs. The idea of hiproofs is to superimpose a labelled hierarchical nesting on an ordinary proof tree. The labels and nesting are used to describe the organisation of the proof, typically relating to its construction process. This can be useful for… (More)

- Bernd Krieg-Brückner, Dieter Hutter, +9 authors Martin Wirsing
- WADT
- 2002

The aim of the MMiSS project is the construction of a multimedia Internet-based adaptive educational system. Its content will initially cover a curriculum in the area of Safe and Secure Systems. Traditional teaching materials (slides, handouts, annotated course material, assignments, and so on) are to be converted into a new hypermedia format, integrated… (More)

- Christoph Lüth, Burkhart Wolff
- J. Funct. Program.
- 1999

The design of theorem provers, especially in the LCF-prover family, has strongly profited from functional programming. This paper attempts to develop a metaphor suited to visualize the LCF-style prover design, and a methodology for the implementation of graphical user interfaces for these provers and encapsulations of formal methods. In this problem domain,… (More)