• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

A Linear Logical Framework (1996)

Cached

  • Download as a PDF

Download Links

  • [www.cs.stanford.edu]
  • [theory.stanford.edu]
  • [foxnet.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [theory.stanford.edu]
  • [www-2.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Iliano Cervesato , Frank Pfenning
Citations:234 - 48 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Cervesato96alinear,
    author = {Iliano Cervesato and Frank Pfenning},
    title = {A Linear Logical Framework},
    booktitle = {},
    year = {1996},
    pages = {264--275},
    publisher = {IEEE Computer Society Press}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We present the linear type theory LLF as the forAppeared in the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96 (E. Clarke editor), pp. 264--275, New Brunswick, NJ, July 27--30 1996. mal 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. 1 Introduction A logical framework is a formal system desig...

Keyphrases

linear logical framework    concise representation    dependent type    eleventh annual ieee symposium    clarke editor    operational interpretation    new brunswick    deductive system    logical framework    mal basis    conservative extension    lf logical framework    expressive power    linear logic    type preservation    whole new class    logic programming language    cut elimination theorem    formal system desig    operational semantics    computer science lics    classical linear logic    linear type theory llf    type system    type inference    sequent calculus   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University