| | |
Summary: Slide 1
Weak Normalization for the Simply-Typed
Lambda-Calculus in Twelf
Andreas Abel
ProgLog, Chalmers
G¨oteborg, Sweden
June 9, 2004
Work supported by: GKLI (DFG), TYPES & APPSEM-II (EU), CoVer (SFF)
Slide 2
Twelf
· Logical framework based on the Edinburgh LF
(dependently-typed -calculus)
· Propositions-as-types, derivations-as-objects
· Higher-order abstract syntax
· Terms: abstraction, application, user-def. constants
· Terms considered upto -equality
· No user-def. reduction rules: all functions parametric
· Types: dependent function, user-def. type family constants
· Logic programming through proof search
1
|
