Toggle Main Menu Toggle Search

Open Access padlockePrints

Polar: A framework for proof refactoring

Lookup NU author(s): Dr Iain Whiteside


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


We present a prototype refactoring framework based on graph rewriting and bidirectional transformations that is designed to be generic, extensible, and declarative. Our approach uses a language-independent graph meta-model to represent proof developments in a generic way. We use graph rewriting to enrich the meta-model with dependency information and to perform refactorings, which are written as declarative rewrite rules. Our framework, called POLAR, is implemented in the GRGEN rewriting engine. © Springer-Verlag 2013.

Publication metadata

Author(s): Dietrich D, Whiteside I, Aspinall D

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: LPAR: International Conference on Logic for Programming Artificial Intelligence and Reasoning

Year of Conference: 2013

Pages: 776-791

Publisher: Springer


DOI: 10.1007/978-3-642-45221-5_52

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ISBN: 9783642452208