Skip to main content
Conference ProceedingsOPEN ACCESS

Compiling logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7841 LNCS 111-126
DOI: 10.1007/978-3-642-37635-1_7
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © IFIP International Federation for Information Processing 2013.

Cite

CITATION STYLE

APA

Codescu, M., Horozal, F., Jakubauskas, A., Mossakowski, T., & Rabe, F. (2013). Compiling logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7841 LNCS, pp. 111–126). https://doi.org/10.1007/978-3-642-37635-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free