A concurrent logical framework: The propositional fragment

Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker

Research output: Chapter in Book/Report/Conference proceedingChapter

54 Scopus citations

Abstract

We present the prepositional fragment CLFo of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language. The underlying type theory uses monadic types to segregate values from computations. This separation leads to a tractable notion of definitional equality that identifies computations differing only in the order of execution of independent steps. From a logical point of view our type theory can be seen as a novel combination of lax logic and dual intuitionistic linear logic. An encoding of a small Petri net exemplifies the representation methodology, which can be summarized as "concurrent computations as monadic expressions".

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsStefano Berardi, Mario Coppo, Ferruccio Damiani
PublisherSpringer Verlag
Pages355-377
Number of pages23
ISBN (Print)3540221646
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3085
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A concurrent logical framework: The propositional fragment'. Together they form a unique fingerprint.

Cite this