A linear logical framework

Authors:
Iliano Cervesato;Frank Pfenning
Affiliations:
Advanced Engineering and Sciences Division, ITT Industries, Inc., Alexandria, Virginia;Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
Information and Computation
Year:
2002

Citing 31
Cited 25

Linear logic

Theoretical Computer Science
From operational semantics to abstract machines: preliminary results

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Polymorphic type inference and assignment

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference for polymorphic references

Information and Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Logic programming in the LF logical framework

Logical frameworks
Encoding dependent types in an intuitionistic

Logical frameworks
An algorithm for testing conversion in type theory

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
Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
Logic programming in a fragment of intuitionistic linear logic

Papers presented at the IEEE symposium on Logic in computer science
A simplified account of polymorphic references

Information Processing Letters
A syntactic approach to type soundness

Information and Computation
Proof theoretic approach to specification languages

Proof theoretic approach to specification languages
Logic programming in intuitionistic linear logic: theory, design, and implementation

Logic programming in intuitionistic linear logic: theory, design, and implementation
Proof-theoretic foundation of compilation in logic programming languages

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
A simple applicative language: mini-ML

LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Efficient resource management for linear logic proof search

Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Structural cut elimination

Information and Computation
The Definition of Standard ML

The Definition of Standard ML
A Term Calculus for Intuitionistic Linear Logic

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
The Practice of Logical Frameworks

CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Elf: A Meta-Language for Deductive Systems (System Descrition)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated Theorem Proving in a Simple Meta-Logic for LF

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Structural Cut Elimination

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Linear higher-order pre-unification

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework

A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
The machine-assisted proof of programming language properties

The machine-assisted proof of programming language properties

A formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Model checking linear logic specifications

Theory and Practice of Logic Programming
On equivalence and canonical forms in the LF type theory

ACM Transactions on Computational Logic (TOCL)
Correspondence assertions for process synchronization in concurrent communications

Journal of Functional Programming
SIGACT news logic column 14

ACM SIGACT News
Hybridizing a Logical Framework

Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts

Journal of Automated Reasoning
Mechanizing metatheory in a logical framework

Journal of Functional Programming
Specifying Properties of Concurrent Computations in CLF

Electronic Notes in Theoretical Computer Science (ENTCS)
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
Nominal logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Uniqueness Typing Simplified

Implementation and Application of Functional Languages
Coercive subtyping in lambda-free logical frameworks

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Typechecking Safe Process Synchronization

Electronic Notes in Theoretical Computer Science (ENTCS)
Making "stricterness" more relevant

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Session types as intuitionistic linear propositions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Verifying stateful programs with substructural state and hoare types

Proceedings of the 5th ACM workshop on Programming languages meets program verification
Singleton: a general-purpose dependently-typed assembly language

Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Dependent session types via intuitionistic linear type theory

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Secure distributed programming with value-dependent types

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Making "stricterness" more relevant

Higher-Order and Symbolic Computation
Hybrid

Journal of Automated Reasoning
ILC: a foundation for automated reasoning about pointer programs

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Management of change in declarative languages

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
An improved proof-theoretic compilation of logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the linear type theory λΠ-o&T as the formal basis for LLF, a conservative extension of the logical framework LF. 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 mutable references including its type system and its operational semantics and describe how to take practical advantage of the representation of its computations.