| | |
Summary: Slide 1
Weak Normalization for the Simply-Typed
Lambda-Calculus in Twelf
A Case Study on Higher-Order Abstract Syntax
Andreas Abel
LFM'04, IJCAR
Cork, Ireland
July 5, 2004
Work supported by: GKLI (DFG), TYPES & APPSEM-II (EU), CoVer (SSF)
Slide 2
Twelf
· Logical framework based on the Edinburgh LF
(dependently-typed -calculus)
· Propositions-as-types, derivations-as-objects
· Higher-order abstract syntax (HOAS)
· No internal recursion or induction
· Higher-order logic programming
· Applications:
Prototyping of logics and programming languages
Verification of syntactic properties (e.g., Church-Rosser,
|
