论文信息 - Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)

Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)

CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security protocol analysis, process algebras, and logics. Celf is an implementation of the CLF type theory that extends the LF type theory by linear types to support representation of state and a monad to support representation of concurrency. It relies on the judgments-as-types methodology for specification and the interpretation of CLF signatures as concurrent logic programs [LPPW05] for experimentation. Celf is written in Standard ML and compiles with MLton, MLKit, and SML/NJ. The source code and a collection of examples are available from http://www.twelf.org/~celf .

Carsten Schürmann | Anders Schack-Nielsen

[1] D. Walker,et al. A concurrent logical framework I: Judgments and properties , 2003 .

[2] Frank Pfenning,et al. System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[3] Frank Pfenning,et al. Monadic concurrent linear logic programming , 2005, PPDP.

[4] Roger M. Needham,et al. Using encryption for authentication in large networks of computers , 1978, CACM.

[5] David Walker,et al. A Concurrent Logical Framework II: Examples and Applications , 2003 .

[6] Furio Honsell,et al. A framework for defining logics , 1993, JACM.

[7] Jaime G. Carbonell,et al. Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.