Compiling Logics

  • Mihai Codescu
  • Fulya Horozal
  • Aivaras Jakubauskas
  • Till Mossakowski
  • Florian Rabe
Conference paper

DOI: 10.1007/978-3-642-37635-1_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7841)
Cite this paper as:
Codescu M., Horozal F., Jakubauskas A., Mossakowski T., Rabe F. (2013) Compiling Logics. In: Martí-Oliet N., Palomino M. (eds) Recent Trends in Algebraic Development Techniques. WADT 2012. Lecture Notes in Computer Science, vol 7841. Springer, Berlin, Heidelberg

Abstract

We present an architecture that permits compiling declarative logic specifications (given in some type theory like LF) into implementations of that logic within the Heterogeneous Tool Set Hets. The central contributions are the use of declaration patterns for singling out a suitable subset of signatures for a particular logic, and the automatic generation of datatypes and functions for parsing and static analysis of declaratively specified logics.

Copyright information

© IFIP International Federation for Information Processing 2013

Authors and Affiliations

  • Mihai Codescu
    • 1
  • Fulya Horozal
    • 3
  • Aivaras Jakubauskas
    • 3
  • Till Mossakowski
    • 2
  • Florian Rabe
    • 3
  1. 1.Friedrich-Alexander UniversityErlangen-NürnbergGermany
  2. 2.DFKI GmbH BremenGermany
  3. 3.Computer ScienceJacobs University BremenGermany

Personalised recommendations