System Description: Twelf - A Meta-Logical Framework for Deductive Systems

  title={System Description: Twelf - A Meta-Logical Framework for Deductive Systems},
  author={Frank Pfenning and Carsten Sch{\"u}rmann},
Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It relies on the LF type theory and the judgments-as-types methodology for specification [HHP93], a constraint logic programming interpreter for implementation [Pfe91], and the meta-logic M2 for reasoning about object languages encoded in LF [SP98]. It is a significant extension and complete reimplementation of the Elf system [Pfe94… 

System Description : Celf – A Logical Framework for Deductive and Concurrent Systems

Celf is an implementation of the CLF type theory that extends the LF type theory by linear types toSupport representation of state and a monad to support representation of concurrency.

Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)

Celf is an implementation of the CLF type theory that extends the LF type theory by linear types toSupport representation of state and a monad to support representation of concurrency.

Mechanizing metatheory in a logical framework

An up-to-date overview of the LF λ-calculus, the LF methodology for adequate representation, and the Twelf methodology for mechanizing metatheory is provided.

The Twelf Proof Assistant

This work designs special purpose logical frameworks for capturing reoccurring concepts for special domains, such as, for example, variable renaming, substitution application, and resource management for programming language theory.

Twelf and Delphin: Logic and Functional Programming in a Meta-logical Framework

The meta-logical framework Twelf [PS99] is being discussed here that is a logical framework that supports reasoning about encodings of object-languages and deductions prevalent in the areas of programming languages, mobile code and logics design.

Two-Level Meta-reasoning in Coq

This paper presents a methodology which allows Coq to be used as a framework for meta-reasoning and gives an approach to reasoning in Coq which very closely mimics reasoning in FOλ ΔN illustrating a close correspondence between the two frameworks.

Implementing Substructural Logical Frameworks

This thesis develops the theoretical infrastructure required to implement — and gives an implementation of — a new logical framework that extends LF with the concepts of both linear resources and affine resources, and proves strong normalization, type preservation, and confluence for a context-split-oblivious reduction semantics.

Imperative LF Meta-Programming

  • Aaron Stump
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2008

Multi-level Meta-reasoning with Higher-Order Abstract Syntax

This paper solves the problem of reasoning by (co)induction in presence of non-stratifiable hypothetical judgments, which allow very elegant and succinct specifications.

Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax




Elf: A Meta-Language for Deductive Systems (System Descrition)

An overview of how speciica-tion, implementation, and meta-theory tasks are supported in the Elf language and some case studies are described.

Automated Theorem Proving in a Simple Meta-Logic for LF

A meta-logic M2 is developed which allows inductive reasoning over LF encodings, and its implementation is described in Twelf, a special-purpose automated theorem prover for properties of logics and programming languages.

A framework for defining logics

The Edinburgh Logical Framework provides a means to define (or present) logics through a general treatment of syntax, rules, and proofs by means of a typed λ-calculus with dependent types, whereby each judgment is identified with the type of its proofs.

Logic programming in the LF logical framework

A Meta-Logic for Unification, a Generalization of Lλ Unification to LF, and Precompleteness of the Transformations for unification.

Unification via Explicit Substitutions: The Case of Higher-Order Patterns

This paper investigates the case of higher-order patterns as introduced by Miller and sketches an efficient implementation of the abstract algorithm and its generalization to constraint simplification, which has yielded good experimental results at the core of a higher- order constraint logic programming language.

Mode and Termination Checking for Higher-Order Logic Programs

We consider how mode (such as input and output) and termination properties of typed higher-order constraint logic programming languages may be declared and checked effectively. The systems that we

Computation and Deduction

Draft notes for a course given at Carnegie Mellon University during the fall semester of 1994, with author Frank Pfenning and the National Football League.