A framework for defining logics
Journal of the ACM (JACM)
Using encryption for authentication in large networks of computers
Communications of the ACM
System Description: Twelf - A Meta-Logical Framework for Deductive Systems
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Curry-Style explicit substitutions for the linear and affine lambda calculus
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Trace matching in a concurrent logical framework
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Linear logical voting protocols
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
A logical correspondence between natural semantics and abstract machines
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Analysing vote counting algorithms via logic: and its application to the CADE election scheme
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
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.