Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Polar: A framework for proof refactoring

Lookup NU author(s): Dr Iain Whiteside

Downloads

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

Abstract

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

URL: https://doi.org/10.1007/978-3-642-45221-5_52

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

Share