1 / 24

Weak Normalization

Weak Normalization. July 05, 2013. Definition. A term M is weakly normalizing if there exists a finite reduction sequence . Syntax. Typing Rules. Proof Idea. Term Abstraction. Reducibility Candidates. Reducibility Candidates. Forward and Backward Closed. Fundamental Lemma.

elga
Télécharger la présentation

Weak Normalization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. WeakNormalization July 05, 2013

  2. Definition • A term M is weakly normalizing if there exists a finite reduction sequence.

  3. Syntax

  4. Typing Rules

  5. Proof Idea

  6. Term Abstraction

  7. Reducibility Candidates

  8. Reducibility Candidates

  9. Forward and BackwardClosed

  10. Fundamental Lemma

  11. Fundamental Lemma

  12. Fundamental Lemma

  13. Fundamental Lemma

  14. Extension: Recursion

  15. Extension: Recursion

  16. Extension: Contextual Types

  17. Extension: Contextual Types

  18. Extension: Contextual Types

  19. Extension: General Case

  20. Extension: General Case

  21. Extension: General Case

  22. Extension: let-box

  23. Extension: let-box

  24. Reducibility Candidates

More Related