All pages

From The Twelf Project

Jump to: navigation, search
All pages

%.%assert%block
%clause%covers%establish
%freeze%mode
%name
%prove%query%querytabled
%reduces%solve%subord
%tabled%terminates%thaw
%theorem%total%trustme
%unique%use%worlds
Abbrev declarationAbout The Twelf ProjectAbstract syntax
Ad hoc binding structuresAdequacy
Admissibility of cutAlpha-equivalenceAmbiguous hyperkind
Ask Twelf ElfAsk Twelf Elf:Short answers
Beta-equivalence
Bibliography of LF
CPS conversion
Canonical formCanonical forms lemma
Case studiesCatch-all case
Church-Rosser via complete developmentClassical S5
Concrete representation
Congruence relation
Constraint domainConstraint domains and coverage checking
Converting between implicit and explicit parametersCorrectness of mergesortCoverage checking
Debugging coverage errors
Define declaration
Dependent typesDeterministic declaration
Division over the natural numbersDocumentationDownload
Effectiveness lemma
EqualityEquivalence relation
Error messagesEta-equivalence
Exchange lemmaExplicit context
Fixity declarationFocusing
Function
General description of TwelfGlossary
GroundHOAS nat bijection
Hereditary substitutionHereditary substitution for the STLCHereditary substitution for the STLC (part 2)
Higher-order abstract syntax
Higher-order judgements
Hypothetical judgmentImplicit and explicit parameters
Incremental metatheorem development
Indexed HOAS nat bijectionIndexed lists
Intrinsic and extrinsic encodingsIntroductions to Twelf
Judgment
LF
LetrecLexicographical orderings with densityLily
Linear logicLists
Logic programmingMailing listsMain Page
Manipulating proof witnesses as inputs
Meta-logicMetatheorem
Modes of useMutable stateMutual induction
Naming conventionsNatural numbers
Natural numbers with inequalityNegation as failure
Numeric termination metricsObject logic
Output factoring
Output freenessPLTheory:Introduction to Twelf
Pattern matchingProgramming language theory with Twelf
Proving metatheorems with Twelf
Reasoning from falseReformulating languages to use hypothetical judgements
RelationRelease history
Research projects using TwelfRespects lemma
Sets and supersets
Simplifying dynamic clausesSimply-typed lambda calculus
Strengthening
Structural metrics
Subordination
Substitution lemmaSudokuSummer school 2008
Summer school 2008:Alternate typed arithmetic expressions with sumsSummer school 2008:Arithmetic expressionsSummer school 2008:Arithmetic expressions with call-by-value let-binding
Summer school 2008:Arithmetic expressions with let-bindingSummer school 2008:Arithmetic expressions with let-binding (hypothetical evaluation)
Summer school 2008:Encoding of System FSummer school 2008:Exercises 1Summer school 2008:Exercises 2
Summer school 2008:Exercises 3Summer school 2008:Type safety for MinML (extrinsic encoding)Summer school 2008:Type safety for MinML (intrinsic encoding)
Summer school 2008:Type safety for MinML with monadic effectsSummer school 2008:Type safety for MinML with monadic effects (putngetn)Summer school 2008:Type safety for polymorphic MinML (intrinsic encoding)
Summer school 2008:Typed arithmetic expressionsSummer school 2008:Typed arithmetic expressions (extrinsic encoding)Summer school 2008:Typed arithmetic expressions (value)
Summer school 2008:Typed arithmetic expressions with pairsSummer school 2008:Typed arithmetic expressions with sumsSummer school 2008:Typed arithmetic expressions with sums 2
Syntax (Object logic)Tabled logic programming
Tactical theorem proving
Theorem proverTotality assertion
Tutorials
TwelfTagTwelf Elf Rotation Charter
Twelf Live
Twelf signatureTwelf style guideTwelf with Emacs
Twelf without EmacsType family
UnificationUniqueness lemma
Unsafe modeUser's GuideUser-defined constraint domain
Using nat-less with %reduces
Weakening lemmaWhat's new
World subsumption
Zermelo Frankel
Views
Personal tools