Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2503887acmconferencesBook PagePublication PageslfmtpConference Proceedingsconference-collections
LFMTP '13: Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
ACM2013 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ICFP'13: ACM SIGPLAN International Conference on Functional Programming Boston Massachusetts USA 23 September 2013
ISBN:
978-1-4503-2382-6
Published:
23 September 2013
Sponsors:

Bibliometrics
Skip Abstract Section
Abstract

This volume constitutes the proceedings of the Eighth International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, LFMTP 2013. The LFMTP workshop series resulted from the amalgamation of the Logical Frameworks and Meta-languages (LFM) and the Mechanized Reasoning about Languages with Variable Binding (MERλIN) workshop series. Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science.

LFMTP 2013 has a historical theme: "Twenty-five years of Logical Frameworks", based on the seminal publication describing the Edinburgh Logical Framework (LF), "A framework for defining logics", by Harper, Honsell and Plotkin in LICS 1987. (Both Harper and Honsell are invited speakers at LFMTP 2013.) Some of the ideas and techniques to uniformly represent and reason about formal systems go back well before 1987 (e.g., Church's representation of binding in the presentation of his Simple Theory of Types, but also contributions by many other people to many other aspects of the field). Nonetheless the years 1986-1990 were remarkably fruitful for modern notions of logical framework. The archaeological ancestor of LFMTP is the Workshop on General Logic held by the Edinburgh University Laboratory for Foundations of Computer Science in Feb. 1987. The Harper, Honsell and Plotkin paper on LF brought together the notions of higher order abstract syntax (HOAS) and judgments as types using dependent types. The best known current descendant of this LF work is the Twelf system, both theory and implementation, developed over many years by Frank Pfenning and his many collaborators. The paper by Wang and Nadathur in these proceedings continues this line of work. Work originally stemming from the LF paper has inspired much theoretical development over recent years; the paper by Cave and Pientka in this volume extends one of these lines of thinking.

Much else was going on in the field of logical frameworks in the years 1986-1990. Dale Miller and his collaborators showed that an intuitionistic fragment of Church's Simple Theory of Types also forms a powerful logical framework. (Miller is an invited speaker at LFMTP 2013.) Although the same HOAS approach is used here as in the Edinburgh LF/Twelf works, there are many important differences; e.g., higher order simple types vs. first order dependent types. The current descendants of this approach include the higher order logic programming language λProlog and the Abellasystem for reasoning about λProlog specifications.

Pure Type Systems (PTS), a very different kind of framework for a large class of type theories, was also developed in 1988-1990. Rather than a language for expressing formal systems, as the aforementioned frameworks, PTS is a single formal system that is parameterized in such a way that by different instantiations it captures many previously known type systems, and permits reasoning uniformly about interesting classes of type systems. The paper by van Doorn, Geuvers and Wiedijk in this volume furthers this approach.

The area of logical frameworks has continued to expand and inspire interesting technical developments. The remaining papers in these proceedings (Rasmussen and Filinski, Farooque, Graham-Lengrand and Mahboubi) only hint at how active and exciting the field is today.

LFMTP 2013 was held on September 23, 2013, in Boston, MA, USA, as a workshop associated with ICFP 2013, the 18th ACM SIGPLAN International Conference on Functional Programming. In addition to presentations of the contributed papers contained in this proceedings, the program included invited talks by Robert Harper (Carnegie Mellon University), Furio Honsell (Università di Udine) and Dale Miller (INRIA Saclay), together with a short paper presentation. The full program can be found at the web site for LFMTP 2013.

LFMTP is a referred workshop series. Each contributed paper was reviewed by three members of the program committee. Acceptance decisions were made by consensus, based on the reviews. Authors of accepted papers were given an opportunity to revise their manuscripts prior to their presentation to take cognizance of the reviews. The papers contained in these proceedings are the end result of this process.

Skip Table Of Content Section
SESSION: Invited talk I
invited-talk
Foundational proof certificates: making proof universal and permanent

Consider a world where exporting proof evidence into a declarative, universal, and permanent format is taken as ``feature zero'' for computational logic systems. In such a world, provers will be able to communicate and share theorems and proofs; ...

SESSION: Workshop presentations I
research-article
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus

We describe how the Davis-Putnam-Logemann-Loveland procedure DPLL is bisimilar to the goal-directed proof-search mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on ...

research-article
First-class substitutions in contextual type theory

In this paper, we revisit the theory of first-class substitution in contextual type theory (CTT); in particular, we focus on the abstract notion of substitution variables. This forms the basis for extending Beluga, a dependently typed proof and ...

research-article
Explicit convertibility proofs in pure type systems

We define type theory with explicit conversions. When type checking a term in normal type theory, the system searches for convertibility paths between types. The results of these searches are not stored in the term, and need to be reconstructed every ...

SESSION: Invited talk II
invited-talk
25 years of formal proof cultures: some problems, some philosophy, bright future

Throughout the history of Mathematics, several different proof cultures have co-existed, and still do co-exist. After 25 years of Logical Frameworks, we can say that even as far as proof metalanguages go, a definitive system is utopian and that we are ...

SESSION: Workshop presentations II
research-article
Structural logical relations with case analysis and equality reasoning

Formalizing proofs by logical relations in the Twelf proof assistant is known to be notoriously difficult. However, as demonstrated by Schürmann and Sarnat [In Proc. of 23rd Symp. on Logic in Computer Science, 2008] such proofs can be represented and ...

research-article
Towards extracting explicit proofs from totality checking in twelf

The Edinburgh Logical Framework (LF) is a dependently type lambda calculus that can be used to encode formal systems. The versatility of LF allows specifications to be constructed also about the encoded systems. The Twelf system exploits the ...

Contributors
  • University of Milan
  • McGill University
  • Harvard University
Index terms have been assigned to the content through auto-classification.

Recommendations

Acceptance Rates

LFMTP '13 Paper Acceptance Rate 5 of 7 submissions, 71%;
Overall Acceptance Rate 11 of 20 submissions, 55%
YearSubmittedAcceptedRate
LFMTP '1413646%
LFMTP '137571%
Overall201155%