Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CLF: A logical framework for concurrent systems Kevin Watkins
 

Summary: CLF: A logical framework for concurrent systems
Kevin Watkins
Carnegie Mellon University
May 13, 2003
Abstract
The logical framework LF and its instantiation in the Elf language support the
speci cation and implementation of a wide range of logical systems. The concrete rep-
resentation of object systems of interest is based on the LF methodology of judgments
as types. Implementations of Elf support checking LF terms, proof search via a logic
programming interpretation, representations of meta-theorems and their proofs, and
(in the Twelf system) the checking of and automated search for meta-proofs. LF's
attractive representation methodology is extended to naturally encompass systems in-
volving state in the linear logical framework LLF, the basic representation principle
becoming state as linear hypotheses. The LLF representation of stateful systems ade-
quately represents all the possible executions of such systems. However, computations
di ering only in the order of execution of independent steps are represented by unequal
LLF terms. Meta-theoretic investigations including an essential element of concurrency
remain cumbersome.
The concurrent logical framework CLF addresses this issue by making concurrency
an intrinsic part of the framework's equality. It extends the language of LLF to include

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University

 

Collections: Mathematics