Hostname: page-component-8448b6f56d-qsmjn Total loading time: 0 Render date: 2024-04-25T03:56:50.431Z Has data issue: false hasContentIssue false

Special issue on Logical Frameworks and Metalanguages http//www-sop.inria.fr/certilab/LFM00/cfp-jfp.html

Published online by Cambridge University Press:  01 January 2000

Joëlle Despeyroux
Affiliation:
INRIA Email: Joelle.Despeyroux@inria.fr
Robert Harper
Affiliation:
CMU Email: Robert.Harper@cs.cmu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Logical frameworks and meta-languages are intended as a common substrate for representing and implementing a wide variety of logics and formal systems. Their definition and implementation have been the focus of considerable work over the last decade. At the heart of this work is a quest for generality: A logical framework provides a basis for capturing uniformities across deductive systems and support for implementing particular systems. Similarly a meta-language supports reasoning about and using languages.

Logical frameworks have been based on a variety of different languages including higher-order logics, type theories with dependent types, linear logic, and modal logic. Techniques of representation of logics include higher-order abstract syntax, inductive definitions or some form of equational or rewriting logic in which substitution is explicitly encoded.

Examples of systems that implement logical frameworks include Alf, Coq, NuPrl, HOL, Isabelle, Maude, lambda-Prolog and Twelf. An active area of research in such systems is the study of automated reasoning techniques. Current work includes the development of various automated procedures as well as the investigation of rewriting tools that use reflection or make use of links with systems that already have sophisticated rewriting systems. Program extraction and optimization are additional topics of ongoing work.

Type
CALL FOR PAPERS
Copyright
© 2000 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.