Theoretical Computer Science
Type inference for polymorphic references
Information and Computation
Logic programming in the LF logical framework
Logical frameworks
Encoding dependent types in an intuitionistic
Logical frameworks
A framework for defining logics
Journal of the ACM (JACM)
Natural semantics and some of its meta-theory in Elf
ELP'91 Conference Proceedings on Extensions of logic programming
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
A syntactic approach to type soundness
Information and Computation
Proof theoretic approach to specification languages
Proof theoretic approach to specification languages
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
Elf: A Meta-Language for Deductive Systems (System Descrition)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Linear logic programming with an ordered context
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for certified binaries
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
An expressive, scalable type theory for certified code
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Proving Syntactic Properties of Exceptions in an Ordered Logical Framework
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Natural Deduction for Intuitionistic Non-communicative Linear Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
Handbook of automated reasoning
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Representing reductions of NP-complete problems in logical frameworks: a case study
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
A type system for certified binaries
ACM Transactions on Programming Languages and Systems (TOPLAS)
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Collection analysis for Horn clause programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Meta Linear Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order representation of substructural logics
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
BI as an assertion language for mutable data structures
ACM SIGPLAN Notices
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
We present the linear type theory LLF as the formal basis for a conservative extension of the LF logical framework. LLF combines the expressive power of dependent types with linear logic to permit the natural and concise representation of a whole new class of deductive systems, namely those dealing with state. As an example we encode a version of Mini-ML with references including its type system, its operational semantics, and a proof of type preservation. Another example is the encoding of a sequent calculus for classical linear logic and its cut elimination theorem. LLF can also be given an operational interpretation as a logic programming language under which the representations above can be used for type inference, evaluation and cut-elimination.