From andreas.abel at ifi.lmu.de Fri Feb 15 09:20:41 2008 From: andreas.abel at ifi.lmu.de (Andreas Abel) Date: Fri, 15 Feb 2008 15:20:41 +0100 Subject: [POPLmark] LFMTP'08 call for papers Message-ID: <47B59FB9.9040909@ifi.lmu.de> International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'08) http://www4.in.tum.de/~lfmtp Pittsburgh, PA, USA, 23 June 2008 Affiliated with Logic in Computer Science (LICS 2008) CALL FOR PAPERS Important dates: --------------------------------------------------------------------- Abstract submission: 14 April 2008 Paper submission: 21 April 2008 Author notification: 19 May 2008 Final version: 2 June 2008 Workshop day: 23 June 2008 --------------------------------------------------------------------- The LFMTP workshop continues the International workshop on Logical Frameworks and Meta-languages (LFM) and the MERLIN workshop on MEchanized Reasoning about Languages with variable BIndingIN. 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. Their design and implementation on the one hand and their applications in for example proof-carrying code have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss all aspects of logical frameworks and variable binding. The broad subject areas of LFMTP'08 are: * The automation and implementation of the meta-theory of programming languages and related calculi, particularly work which involves variable binding and fresh name generation. * The theoretical and practical issues concerning the encoding of variable binding and fresh name generation, especially the representation of, and reasoning about, datatypes defined from binding signatures. * Case studies of meta-programming, and the mechanization of the (meta)theory of descriptions of programming languages and other calculi. Papers focusing on logic translations and on experiences with encoding programming languages theory are particularly welcome. Topics include, but are not limited to * logical framework design * meta-theoretic analysis * applications and comparative studies * implementation techniques * efficient proof representation and validation * proof-generating decision procedures and theorem provers * proof-carrying code * substructural frameworks * semantic foundations * methods for reasoning about logics * formal digital libraries Program Committee: Andreas Abel (LMU Munich) Peter Dybjer (Chalmers University of Technology) Alberto Momigliano (University of Edinburgh) Brigitte Pientka (McGill University) Randy Pollack (University of Edinburgh) Carsten Schuermann (IT University of Copenhagen) Peter Sewell (University of Cambridge) Aaron Stump (Washington University) Christian Urban (TU Munich) Three categories of papers are solicited: * Category A: Detailed and technical accounts of new research: up to fifteen pages including bibliography. * Category B: Shorter accounts of work in progress and proposed further directions, including discussion papers: up to eight pages including bibliography and appendices. * Category C: System descriptions presenting an implemented tool and its novel features: up to six pages. A demonstration is expected to accompany the presentation. Submission is electronic. Authors are required to submit a paper title and a short abstract of about 100 words before submitting the paper. Papers are to be submitted in postscript or PDF format and must conform to the ENTCS style preferably using LaTeX2e. For further information and submission instructions, see the LFMTP web page: http://www4.in.tum.de/~lfmtp Proceedings are to be published as a volume in the Electronic Notes in Theoretical Computer Science (ENTCS) series and will be available to participants at the workshop. Authors of accepted papers are expected to present their paper at the workshop. The organizers: Andreas Abel Christian Urban Theoretical Computer Science Institute for Computer Science Ludwig-Maximilians-University Munich Technical University of Munich Email: andreas.abel at ifi.lmu.de Email: urbanc at in.tum.de -- Andreas Abel <>< Du bist der geliebte Mensch. Theoretical Computer Science, University of Munich http://www.tcs.informatik.uni-muenchen.de/~abel/ From andrew.gacek at gmail.com Sun Feb 17 09:53:25 2008 From: andrew.gacek at gmail.com (Andrew Gacek) Date: Sun, 17 Feb 2008 08:53:25 -0600 Subject: [POPLmark] Abella: Interactive theorem proving with lambda-tree syntax Message-ID: I am happy to announce the public release of Abella, an interactive theorem prover that is designed to reason about structural operational semantics style specifications of dynamic and static properties of an object language. Amongst other things, Abella has been used to prove normalizability properties of the lambda calculus, cut-admissibility for a sequent calculus and type uniqueness and subject reduction properties. The most recent successes include solutions to parts 1a and 2a of the POPLmark challenge and a proof of normalizability for the simply-typed lambda-calculus using a logical relations argument in the style of Tait. Abella is a realization of a two-level logic approach to reasoning in its application domain. One level is defined by a specification logic that supports a transparent encoding of structural operational semantics rules. This logic is a subset of the language of Lambda Prolog and can therefore be animated. The second level, that is called the reasoning logic, embeds the specification logic via definitions of atomic judgments; complicated properties involving these atomic judgments can then be stated and proved in the reasoning logic. An important characteristic of Abella is that it supports the use of lambda-tree syntax in both the specification and the reasoning logics in providing treatments of binding constructs in object language syntax. Reasoning over lambda-tree syntax is supported by the nabla quantifier introduced by Miller and Tiu and the notion of generic judgments. Abella also incorporates a newly developed extension to the notion of definitions of McDowell and Miller that uses the nabla quantifier to encode stronger properties about atomic judgments that are often essential in reasoning tasks. For more information, the Abella website includes walkthroughs, examples, downloads, and related publications: http://abella.cs.umn.edu/ The distribution material also contains proofs of the various example properties mentioned in this message. I welcome your feedback and any questions you may have. Please contact me directly at andrew.gacek at gmail.com. Thank you, Andrew Gacek From gui.fortaine at orange.fr Sun Feb 17 19:29:37 2008 From: gui.fortaine at orange.fr (FORTAINE Guillaume) Date: Mon, 18 Feb 2008 01:29:37 +0100 Subject: [POPLmark] G6 - Dependable systems Message-ID: <47B8D171.6010201@orange.fr> Misters, Happy New Year to You :) !, Let me introduce myself: Guillaume FORTAINE, Consultant Service Strategy and Innovation. It's an honor for me to send you this mail. I am definitely aware of Your preeminence in the Mathematical Logic World. I have made a compilation of all the bleeding edge stuff in a common Framework (Coq) about Mathematical Logic on this wiki : http://130.246.75.183/gc6wiki/%5Bopen_discussion%5D_universal_mathematical_assistant_systems_%28MAS%29 and I would greatly appreciate to have Your Comments. Moreover, I am working with Mister McGuire on a European Community around Universal Mathematical Assistant Systems : http://www.cas.mcmaster.ca/plmms07/ The intent of this workshop is to examine more closely the intersection between programming languages and mechanized mathematics systems (MMS). By MMS, we understand computer algebra systems (CAS), [automated] theorem provers (TP/ATP), all heading towards the development of fully unified systems (the MMS), sometimes also called universal mathematical assistant systems (MAS) To quote : "Let take 2-3 months to prepare a document where we?ll propose a well defined action/project/way to cooperate. Proposing something that we?ll do and where we?d like to have other contributes. This document will be submitted to all the people that we think that might be interested in it, asking for a specific feedback. Maybe this is just a short step, but this is a starting step, it has to be short and well structured. In that way we?ll be able to contact all those people interested in our proposal without sending too many mails to everybody and in focusing our work." Let's discuss of this opportunity. We look forward to Your Answer, Best Regards, -- Dr. Guillaume FORTAINE Consultant Service Strategy and Innovation Street : Moulin d'Ignaucourt ZIP : 62810 City : BERLENCOURT-LE-CAUROY Country : FRANCE Tel : +33631092519 Quotes : "Scientia potentia est", Sir Francis Bacon "I consider life itself to be an instinct for growth, for endurance, for the accumulation of force, for power: when there is no will to power, there is decline.", Friedrich Nietzsche From rwh at cs.cmu.edu Mon Feb 18 12:21:20 2008 From: rwh at cs.cmu.edu (Robert Harper) Date: Mon, 18 Feb 2008 12:21:20 -0500 Subject: [POPLmark] Paper announcement: Focusing on Binding and Computation Message-ID: <89FBE059-38E8-4999-B6DA-5AD8B2DAF048@cs.cmu.edu> We are pleased to accounce a technical report on a new approach to integrating higher-order abstract syntax with a functional programming language: Focusing on Binding and Computation Daniel R. Licata, Noam Zeilberger, Robert Harper PDF and companion code: http://www.cs.cmu.edu/~drl/pubs.html Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support for both representing and computing with binding. This language is extracted as the Curry-Howard interpretation of a focused sequent calculus with {\em two} kinds of implication, of opposite polarity. The \emph{representational arrow} extends systems of definitional reflection with the notion of a scoped inference rule, which permits the adequate representation of binding via higher-order abstract syntax. On the other hand, the usual \emph{computational arrow} classifies recursive functions over such higher-order data. Unlike many previous approaches, both binding and computation can mix freely. Following Zeilberger [POPL 2008], the computational function space admits a form of open-endedness, in that it is represented by an abstract map from patterns to expressions. As we demonstrate with Coq and Agda implementations, this has the important practical benefit that we can reuse the pattern coverage checking of these tools. Comments welcome! Dan, Noam, and Bob