an introduction to type theory
play

An Introduction to Type Theory Part 3 Tallinn, September 2003 with - PowerPoint PPT Presentation

Mar 04, 2023 •145 likes •1.81k views

An Introduction to Type Theory Part 3 Tallinn, September 2003 with cartoons by Conor McBride http://www.cs.nott.ac.uk/txa/tallinn/ Thorsten Altenkirch University of Nottingham An Introduction to Type Theory p.1/32 The established

  1. � ✁ ✄ ✡ ☞ ✌ ✍ � ✁ ✂ � ✂ ✁ � ✟ ✄ ✄☎ ✆ ✡ ☞ ✌ ✍ ✞ � ✂ ✂ ✆ ✄ ✝ ✁ ✂ ✡ ✁ ☛ ✄ ✁ � ✁ ✂ ✆ ✡ ✄ ✂ � — no dependent types ✞✠✟ let Hindley-Milner: Type quantification and application can be made implicit. Split left hand sides using type information An Introduction to Type Theory – p.6/32

  2. � ✂ ✁ ✂ � ✟ ✄ ✄☎ ✆ � ☞ ✌ ✍ � ✁ � ✁ ✁ ✂ � ✟ ✄ ✄☎ ✆ � ✟ ✡ ✆ ☞ ✌ ✍ � ✂ ✁ ✂ ✆ ✄ ✝ ✁ ✂ ✡ ✄ ☛ ✂ ✁ � ✁ � ✆ ✞ ✍ ✌ ☞ ✡ ✄ ✡ � ✂ ✁ � ✂ ✄ — no dependent types ✞✠✟ let Hindley-Milner: Type quantification and application can be made implicit. Split left hand sides using type information An Introduction to Type Theory – p.6/32

  3. � ✂ ✁ ✂ � ✟ ✄ ✄☎ ✆ � ☞ ✌ ✄ � ✁ � ✁ ✁ ✂ � ✟ ✄ ✄☎ ✆ � ✟ ✡ ✆ ☞ ✌ ✍ � ✂ ✁ ✂ ✆ ✄ ✝ ✁ ✂ ✡ ✄ ☛ ✂ ✁ � ✁ � ✆ ✞ ✍ ✌ ☞ ✡ ✄ ✡ � ✂ ✁ � ✂ ✄ — no dependent types ✞✠✟ let Hindley-Milner: Type quantification and application can be made implicit. Split left hand sides using type information An Introduction to Type Theory – p.6/32

  4. � ✌ ✁ � ✂ ✁ � ✄ ☞ � � ✆ ✄☎ ✄ ✟ � ✂ ✟ ✁ ✌ ✡ ☎ ✄ ✂ ✁ � ☞ ✄ ✆ ✡ ✟ � ✆ ✄☎ ✁ ✂ � ✆ ✆ ✄ ✝ ✁ ✂ ✡ ✄ ☛ ✂ ✁ � ✂ ✂ ✁ ✡ ✡ ✁ � ✍ ✄ ☞ ✌ ✄ ✞ � ✂ ✁ � ✂ — no dependent types ✞✠✟ let Hindley-Milner: Type quantification and application can be made implicit. Split left hand sides using type information An Introduction to Type Theory – p.6/32

  5. � ✂ � ✟ ✄ ✄☎ ✆ � ☞ ✌ ✄ � ✁ ✂ � ✁ � ✁ ☞ ✡ ✄☎ ✂ ✁ � ✌ ✆ ✟ ✡ ✟ � ✆ ✄☎ ✄ ✂ � ✁ ✂ ✆ ✄ ✝ ✁ ✂ ✡ ✄ ☛ ✂ ✁ � ✁ ✂ ✆ ✡ ✄ ✁ � ✍ ✌ ☞ ✡ ✄ ✞ � ✂ ✁ � ✂ is not good ✞✠✟ let An Introduction to Type Theory – p.7/32

  6. � ✂ ✟ � ✆ ✄☎ ✄ ✟ � ✁ ✆ � ✂ ✁ � ✄ ✌ ☞ ✡ ☞ ✁ ✁ ✆ ☎ ✄ ✂ ✁ � ✂ � ✌ ✂ ✁ � ✡ ✄☎ ✂ ✁ � � ✆ ✄☎ ✂ ✄ ✆ ✂ ✁ � ✁ ☛ ✂ ✄ ✡ ✂ ✁ ✝ ✄ ✆ ✄ ✡ � � ✟ � ✂ ✁ � ✂ ✁ ✁ ✍ ✌ ☞ ✡ ✄ ✞ � ✂ is not good ✞✠✟ let The function is partial leads to a runtime error. An Introduction to Type Theory – p.7/32

  7. � ✟ ✆ ✡ ✟ � ✆ ✄☎ ✄ � ✌ ✂ ✁ � ✂ ✁ � ✄ ✁ ☞ � � � ✂ ✁ � ✆ ☎ ✄ ✂ ✁ ✂ ✁ ✁ � ✂ ✁ � ✡ ✄☎ ✂ ☞ ✌ ✆ ✂ ✄ ✄☎ ✆ ✂ ✁ � ✁ ☛ � ✄ ✡ ✂ ✁ ✝ ✄ ✆ ✂ ✡ ✁ � ✄ ✟ � ✂ ✁ � ✂ ✁ ✂ ✍ ✌ ☞ ✡ ✄ ✞ � is not good ✞✠✟ let The function is partial leads to a runtime error. Reason: The type of is not informative enough. An Introduction to Type Theory – p.7/32

  8. An Introduction to Type Theory – p.8/32 ✂ ✂ ✄ ✄ ☎ ✄ ✂ ✁ ☎ ✟ ✞ ✝ ✄ � ✄ ✄ ✄ � � ✂ ✁ ✝ ✄ ✄☎ ✄ ✟ ✝ � ✂ ✁ ✂ ✁ ✟ ✞ ✞ ☎ ✟ ✄ ✄ ☎ � ✄ ☛ ✂ ✁ ✡ ✄ ☛ ✂ ✁ ✄ ✡ ☛ ✂ ✂ ✁ ✂ ✄ ☎ ✝ ☛ ✁ ✂ ✄ ☎ ✂ ✁ ✞✠✟ where data types where ✞✠✟ data data

  9. An Introduction to Type Theory – p.8/32 ✄ ✞ ✄ ✄ ✝ ✞ ✟ ✁ ✂ ✄ ✄ ✂ ✄ ☎ ✝ ☎ ✞ ✟ ✁ ✂ ✁ ✂ � ✟ ✄ ✄☎ ✄ ✝ ✁ ✂ � ✄ ✂ ✟ ✄ ☎ � ✄ ☛ ✂ ✁ ✡ ✄ ☛ ✂ ✁ ✡ ✂ ✄ ☛ ✂ ✁ ✂ ✄ ☎ ✝ ☛ ✁ ✁ ✞✠✟ where data types where ✞✠✟ data data

  10. ✁ � Better data types, better An Introduction to Type Theory – p.9/32

  11. ✓ ✝ � ✜ � ✔ � ✁ ✛ ✄ ✁ ✝ ✂ ✝ ✛ � ✜ ☛ ✆ ✝ ✁ ✛ ✂ ✝ ✛ ✁ ✔ � ✁ � ✄ ✜ ✂ ✝ � ✁ ✁ ✄ � ✁ ✓ ✄ ☎ ☛ ✆ ✂ Better data types, better ☞✂✁ ☞✂✁ ☞✂✁ data where An Introduction to Type Theory – p.9/32

  12. An Introduction to Type Theory – p.9/32 ✌ ✠ ✄ ✁ � ☎ � ✙ ✑ ✁ ✁ ✝ � ✛ ✂ ✄ ✁ � � ✙ ✑ ✁ ✄ ✁ ✁ ✠ ✄ � ✠ ✔ � ✜ ✓ � ✙ ✑ ✁ ✁ ✄ ✠ ✁ ✆ ✜ ✛ ✒ ✙ ✂ � � ✙ ✑ ✁ � ✄ ✁ ✄ � ✜ ✓ ✛ ✝ ✂ ✁ ✆ ☛ ☎ ✁ � � ✄ ✁ � ✛ ✝ ✂ ✄ ✁ � ✁ � ✔ ✁ ☛ ✛ ✝ ✂ ✁ ✝ � ✆ ✜ ✜ � ✛ ✝ ✂ ✁ ✝ ✄ ✔ ✓ Better data types, better ☞✂✁ ☞✂✁ ☞✂✁ where where ☞✂✁ ☞✂✁ data data

  13. � � ✁ ✌ ✝ ✛ ✂ ✄ ✁ � ✙ ✑ ✑ ✁ ✑ ✄ ✙ ✁ � ✄ ✁ ✁ ✙ � � ✄ ✠ ✠ ✜ ✛ ✒ ✙ ✂ � � ✙ ✑ ✁ ✁ ✠ ✄ � ✁ ✠ ☎ � ✔ ✁ � ☛ ☎ ✄ ✓ ✁ � ✄ ✁ ✛ ✂ ✝ ✂ ✜ ✄ � ✁ � ✔ ✁ ✁ ✝ � ✜ ✜ ✓ ✛ ✝ ✂ ✁ ✝ ☛ � ✛ ✛ ✝ ✂ ✁ ✝ ✔ � ✜ ✓ ✁ Better data types, better ☞✂✁ ☞✂✁ data where ☞✂✁ data where An Introduction to Type Theory – p.9/32

  14. An Introduction to Type Theory – p.9/32 ✙ ✁ ✁ ✄ ✠ ✠ ✜ ✛ ✒ ✙ ✂ � � ✑ ✙ ✁ ✁ ✠ ✄ � ✁ ✠ ☎ � ✙ ✑ ✁ ✁ ✌ ✑ � � ✁ � ✁ ✝ � ✆ ✁ ✄ ✛ � ✛ ✝ ✂ ✝ ✓ � � ✙ ✑ ✁ ✁ � ✄ ✁ � ✔ � ✜ ✝ ✛ ✂ ☎ ✄ ✝ ✔ � ✜ ✓ ✛ ✝ ✂ ✁ ☛ ✄ ✝ ✁ � ✄ ✁ � ✛ ✝ ✂ ✄ ✁ � ✁ ✂ ✁ ✛ � ✁ � � ✙ ✑ ✁ ✄ ✁ � ✄ � ✁ ✔ ✝ � ✜ ✜ ☛ ✓ ✛ ✝ ✁ ✂ Better data types, better ☞✂✁ ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  15. An Introduction to Type Theory – p.9/32 ✁ ✠ ✠ ✜ ✛ ✒ ✙ ✂ � � ✙ ✑ ✁ ✠ ✄ ✁ � ✁ ✠ ☎ � ✙ ✑ ✁ ✁ ✌ ✝ ✛ ✄ ✁ ✄ ✝ � ✁ ✝ � ✁ ✄ ✛ � ✛ ✝ ✂ ✁ � ✑ � ✙ ✑ ✁ ✁ � ✔ � ✜ ✓ � ✙ ✂ ✁ � ✄ ✝ ✔ � ✜ ✓ ✛ ✝ ✂ ✁ ☛ ☎ ✁ ✂ � ✄ ✁ � ✛ ✝ ✂ ✄ ✁ � ✁ � ✁ ✝ � ✑ ✁ � ✄ ✁ � ✛ ✙ ✔ ✜ ✁ � ✓ ✛ ✝ ✂ ✁ ✝ ☛ ✜ � ✄ Better data types, better ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  16. An Introduction to Type Theory – p.9/32 � � ✙ ✑ ✁ ✁ ✄ ✠ ✠ ✜ ✛ ✒ ✙ ✂ � ✜ ✙ ✑ ✁ ✁ ✠ ✄ � ✁ ✠ ☎ � ✙ ✑ ✁ ✓ � ✌ ✄ ✂ ✁ � � � ✁ ✄ ✛ � ✁ ✝ � ✁ ✛ ✔ � ✛ ✝ ✂ ✁ ✝ � � ✙ ✑ ✁ ✁ � ✁ ✝ � ☎ ✂ ✁ ✝ ✔ � ✜ ✓ ✛ ✝ ✂ ✁ ☛ ✄ ✛ ✁ � ✄ ✁ � ✛ ✝ ✂ ✄ ✁ � ✁ ✛ ✝ � ✁ ✂ ✄ ✁ � � ✙ ✑ ✁ ✄ ✁ ✜ ✄ � � ✓ ☛ ✝ ✁ ✂ ✛ ✝ ✜ � ✔ Better data types, better ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  17. An Introduction to Type Theory – p.9/32 ✄ ✙ ✑ ✁ ✁ � ✔ � ✜ ✓ � ✙ ✑ ✁ ✁ ✠ � ✙ ✁ � ✠ ✄ ✁ ✁ ✑ � ✠ � ✂ ✙ ✒ ✛ ✜ � ✝ � ✓ ✁ ✂ ✛ ✄ ✁ � ✜ ☛ ☛ ✝ ✔ � ✁ ✂ � ☎ ✁ ✁ ✂ ✝ ✛ � ✛ ✄ � � ✝ ✁ � ✛ ✄ ✁ ✠ ☎ � ✁ ✜ � ✛ ✝ ✂ ✁ ✝ ✔ � ✜ ✓ ✛ ✝ ✂ ☛ ✝ ☎ ✄ ✁ � ✄ ✁ � ✛ ✝ ✂ ✄ ✁ � ✁ ✙ ☛ ✁ ✂ ✑ ✁ ✁ ✌ ✝ ✛ ✂ ✄ ✁ � � ✙ ✑ ✁ ✄ � ✝ ✛ ✓ ✜ � ✔ ✁ ✄ � ✁ Better data types, better ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  18. An Introduction to Type Theory – p.9/32 ✑ ✜ � ✔ � ✁ ✁ ✙ � � � ✝ ✁ ✂ ✝ ✓ ✙ � ✙ ✁ ✑ ✙ � � ✂ ✒ ✑ ✛ ✜ ✠ ✠ ✄ ✁ ✁ ✛ ✛ � � � ✁ ✂ ✛ ✄ ✁ ✓ ☎ ✜ ☛ ✝ ✔ � ✁ ✂ ☛ ✔ ✄ ✄ ✁ � ✝ ✁ � ✛ ✁ ✠ ✄ ✓ ✂ ✙ ✒ ✛ ✜ ✠ ✁ ✠ ✄ � ✁ ✛ ✓ ✜ � ✔ ✝ ✂ ✂ ✝ ✛ � ✜ ☛ ✝ ✝ ✁ ✂ ✛ ✁ � ✁ ✄ ✂ ✝ � ☛ ✁ ✄ � ✁ ✄ ☎ ✁ ✁ ✝ ✌ � ✁ ✄ ✂ ✛ ✝ ✁ ✙ ✁ ✑ ✙ � ☎ ✠ ✛ � ✑ ✄ ✓ ✜ � ✔ � ✁ ✁ � ✁ ✄ Better data types, better ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  19. An Introduction to Type Theory – p.9/32 ✝ ✑ ✙ � � ✝ ✁ ✂ ✛ ✁ � ✛ ✄ ✁ � ✝ ✁ ✁ � ✛ ✄ ✂ ✙ ✒ ✛ ✜ ✠ ✠ ✁ ✔ ✁ ✑ ✙ � ✓ ✜ � � ✄ � ✔ ✙ ✒ ✛ ✜ ✠ ✠ ✄ ✓ ✓ ✜ ☛ ✝ ✔ � ✁ ✂ ✂ ✁ ✁ ✠ ✓ ✂ ✙ ✒ ✛ ✜ ✠ ✄ ✄ ✔ ☎ ☛ � ✁ ✂ ✛ � � ✙ ✂ ✓ ✜ � ✔ ✝ ✁ ✝ ✝ ✛ � ✜ ☛ ✝ ✁ ✂ ✛ ✂ ✛ ✛ ✁ � ✁ ✄ ✂ ✝ � ✁ ✁ ✄ � ✁ ✄ ☎ ☛ ✑ ✝ ✓ ✙ ✛ ✝ ✌ ✁ ✁ ✑ � ✄ ☎ ✠ ✁ � ✠ ✄ ✁ ✁ ✜ ✂ ✁ ✁ � � ✙ ✑ � ✁ ✔ ✄ � ✁ � ✄ Better data types, better ☞✂✁ where where let ☞✂✁ ☞✂✁ data data

  20. An Introduction to Type Theory – p.9/32 ✄ ✝ ✁ ✂ ✝ ✛ � ✛ ✁ � � ✝ ✁ � ✛ ✄ ✁ � ✙ ✂ ✑ ✛ ✜ ✠ ✠ ✄ ✁ ✁ ✙ ✑ � ✓ ✜ � ✔ � ✁ ✁ ✓ ✙ � ✁ ✔ ✓ ✜ ☛ ✝ ✔ � ✛ ✠ ✄ ✁ ✠ ✄ ✝ ✛ ✄ ✁ ✠ ✄ ✜ ✒ � ✛ ✜ ✠ ✠ ✄ ✔ ☎ ☛ ✁ ✛ ✠ ✛ ✄ ✁ ✓ ✂ ✙ ✒ ✒ ✙ ✂ ✛ ✜ � ✔ ✝ ✁ ✂ ✝ � ✛ ✜ ☛ ✝ ✁ ✂ ✝ � ✓ ✝ ✜ � ✁ � ✁ ✄ ✂ ✝ ✛ ✁ ✂ ✄ � ✁ ✄ ☎ ☛ ✁ ✓ ✛ � ✂ � ✁ ✠ ☎ � ✙ ✁ ✑ ✁ ✁ ✔ ✌ ✝ ✛ ✄ ✁ ✙ � � ✁ ✄ � ✁ ✄ ✁ ✑ ✁ ✑ ✙ � � ✠ ✄ Better data types, better ☞✂✁ where where let is a total function. ☞✂✁ ☞✂✁ data data

  21. An Introduction to Type Theory – p.9/32 � � ✛ ✄ ✁ � ✝ ✁ ✛ ✝ ✄ ✁ ✓ ✂ ✙ ✒ ✛ ✜ ✛ ✂ ✠ ✄ � ✄ ✁ ✁ ✑ ✙ � ✓ ✜ ✔ ✁ � ✁ ✁ ✑ ✙ � � ✝ ✠ ✔ ✠ ✁ ✁ ✛ ✄ ✁ ✠ ✄ ✝ ✛ ✄ ✛ ✔ ✄ ✁ � ✁ ✂ ✄ ☎ ✆ � ✝ ☎ ✂ ☛ � ✁ ✠ ✛ ✄ ✁ ✓ ✙ ☛ ✒ ✛ ✜ ✠ ✠ ✄ ✔ ✓ ✜ � ✠ ✜ � � ✔ ✝ ✁ ✂ ✝ ✛ ✜ ✓ ☛ ✝ ✁ ✂ ✝ ✛ ✓ ✛ ✜ ✛ ✔ � ✁ � ✁ ✄ ✂ ✝ ✛ ✁ ✝ ✄ � ✁ ✄ ☎ ☛ ✁ ✂ � ✜ ✙ ✁ ✁ ✑ � � ☎ ✠ ✂ ✌ � � ✠ ✄ ✁ ✁ ✑ ✁ ✝ ✙ ✙ ✁ ✄ � ✁ ✒ ✄ ✁ ✛ ✑ ✙ � � ✁ ✄ ✂ � Better data types, better ☞✂✁ where is not well-typed. where let is a total function. ☞✂✁ ☞✂✁ data data

  22. Verify An Introduction to Type Theory – p.10/32

  23. � ✁ ✂ Verify How can we use on lists of unknown length user input,. . . ? An Introduction to Type Theory – p.10/32

  24. ✞ � � ✆ ✄ ✂ ☎ ✄ � ✡ ✄ ✂ ✞ ✁ ✁ ✝ ✁ ✂ ☛ ✄ � ✄ ✡ � ✡ ✆ ✂ ✁ � � Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  25. ✄ ✝ � ☎ ✂ ✄ ✆ � � ✞ ✡ � ✡ ✆ ✁ � ✁ ✞ ✂ � ✄ ✡ ✄ � ✁ ✂ ✍ ✌ ☞ ✡ � ✂ ✄ ☛ ✂ ✁ ✁ � ✁ ✞ ✄ Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  26. ✝ � � ✞ � ✡ ✆ ✁ � ✁ ✞ ✂ ✄ � � ☞ ✌ ✍ ✁ � ✁ ✞ ✂ ✄ � ✟ � ✆ ✆ ✂ � ✁ ✂ ✍ ✌ ☞ ✡ ✄ � ✄ ☛ ✁ ✄ ✁ � ✁ ✞ ✂ ✄ ✡ � ✄ ☎ ✂ ✡ Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  27. ✡ � � ✆ ✁ � ✁ ✞ ✂ ✄ � � ☞ ✌ ✂ ✞ ✁ ✂ ✞ � � ✁ � ✁ ✞ ✂ ✄ � ✟ � ✝ ✆ ✁ � ✁ ✂ ✍ ✌ ☞ ✡ ✄ � ✄ ☛ ✂ ✁ � � ✁ ✞ ✂ ✄ ✡ � ✄ ☎ ✂ ✄ ✆ � ✡ Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  28. � � ✂ ✞ ✁ � ✁ � ✞ � ✂ ✁ ✂ � ✌ ☞ ✆ ✄ ✟ ✄ ✞ � ✆ ✡ ✟ � ✄ ✂ ✁ ✡ � ✁ ✍ ✌ ☞ � ✆ � ✂ � � ✁ � ✁ ✁ ✂ ☛ ✄ ✄ ✂ ✡ ☞ ✌ ✍ ✂ ✁ � ✞ ✄ ✞ ✝ ✁ � ✁ ✆ ✡ � ✞ � ✡ � ✆ ✄ ✂ ☎ ✄ � ✟ Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  29. ✌ � ✡ ✟ � ✄ ✂ ✞ ✁ ✁ � � � ✞ ✂ ✁ ✂ � ✆ ✆ ☞ � ✞ � ✆ ✡ ✟ � ✄ ✂ ✁ ✌ � ✁ ✂ � ✁ ✟ ✁ � ☞ � � ✄ ✞ ✁ � ✁ ✁ ✂ ☛ � ✄ ✄ ✡ ☞ ✌ ✍ ✂ ✁ � ✂ ✡ ✄ � ✂ ✞ ✁ � ✁ ✆ ✡ ✞ � ✝ � � ✆ ✄ ✂ ☎ ✄ ✟ Verify How can we use on lists of unknown length user input,. . . ? let An Introduction to Type Theory – p.10/32

  30. An Introduction to Type Theory – p.10/32 � ✁ ✂ � ✁ ✟ ✁ � ✌ ☞ ✆ ✁ ✡ ✟ � ✄ ✂ ✞ ✁ � ✁ � ✞ � � ✍ ✌ ☞ � ✡ ✄ ✂ ✞ ✁ ✁ ✂ � ✆ � ✟ � ✆ ✡ ✟ � ✄ � ✞ ✂ � ☎ ✄ � ✡ ✄ ✂ ✞ ✁ ✁ ✄ ✁ ✂ ☛ ✄ � ✄ ✡ � ✁ ✂ ✆ ✂ ✂ ✁ ✂ � ✌ ☞ � � ✄ ✞ � ✁ � ✁ ✆ ✡ � ✞ ✝ � on lists of unknown length Verify How can we use user input,. . . ? let

  31. An Introduction to Type Theory – p.10/32 ✁ ✆ � ✟ � ✆ ✡ ✟ � ✄ ✂ ✞ � ✁ ✁ ✂ � ✁ ✟ ✁ � ✌ ☞ � ✆ ✡ � � � ☞ ✍ ✌ ☞ � ✁ ✟ ✁ � � ✍ ✌ � ✁ � ✞ ✂ ✁ ✂ � � � ✡ ✄ ✂ ✞ ✟ ✄ � ✞ � ✆ ✄ ✂ ☎ ✄ � ✡ ✄ ✂ ✁ ✝ � ✁ ✁ ✂ ☛ ✄ � ✄ ✡ � ✁ ✂ ✞ ✂ � ✞ ✁ � ✁ � � ✞ ✂ ✁ ✂ ✌ � ☞ � � ✄ ✂ ✞ ✁ � ✁ ✆ ✡ on lists of unknown length Verify How can we use user input,. . . ? let

  32. An Introduction to Type Theory – p.10/32 ✄ ✁ � ✁ � ✆ � ✟ � ✆ ✡ ✟ � ✂ ✂ ✞ ✁ � ✁ ✂ � ✁ ✟ ✁ � ✌ ☞ ✞ ✄ ✆ ✂ ✍ ✌ ☞ � ✁ ✟ ✁ � � � � ✞ ✁ ✡ ✂ � ✌ ☞ � � ✞ ✂ ✁ ✂ � � � � ✡ ✝ ✞ � � ✆ ✄ ✂ ☎ ✄ � ✡ ✄ ✂ ✁ ✞ � ✁ ✁ ✂ ☛ ✄ � ✄ ✡ � ✁ ✟ � ✂ ✁ � ✄ ✂ ✞ ✁ � ✁ � � ✞ ✂ ✂ ✡ � ✌ ☞ � � ✄ ✂ ✞ ✁ � ✁ ✆ on lists of unknown length Verify How can we use user input,. . . ? let

  33. An Introduction to Type Theory – p.10/32 � � � ✡ ✄ ✂ ✞ ✁ � ✁ � ✆ � ✟ ✆ ✂ ✡ ✟ � ✄ ✂ ✞ ✁ � ✁ ✂ � ✁ ✟ � ✁ � ✟ ✆ � ✂ ✟ � ✁ ✟ ✁ � ✌ ☞ � ✁ ✁ ✂ � � � � ✞ ✂ ✁ ✂ � ✌ ☞ � � ✞ ✁ ✌ � ✂ ✞ ✝ � � ✆ ✄ ✂ ☎ ✄ � ✡ ✄ ✞ ✡ ✁ � ✁ ✁ ✂ ☛ ✄ � ✄ ✡ � ✁ ☞ ✆ ✂ � � ✆ ✡ ✟ � ✄ ✂ ✞ ✁ � ✁ � ✞ ✁ ✂ ✁ ✂ � ✌ ☞ � � ✄ ✂ ✞ ✁ � on lists of unknown length Verify How can we use user input,. . . ? let

  34. Going further An Introduction to Type Theory – p.11/32

  35. ✁ � ✁ ✞ ✂ ✄ Going further The type of is not informative enough for some of its potential applications. An Introduction to Type Theory – p.11/32

  36. ✁ � ✁ � ✁ ✁ � ✄ ✟ ✁ ✡ ✂ � � ✄ ✂ ✞ ✁ � ✁ ✞ Going further The type of is not informative enough for some of its potential applications. How is related to ? An Introduction to Type Theory – p.11/32

  37. ✄ � ✞ ✁ � ✁ � ✂ � ✁ � ✡ ✂ ✂ ✞ ✁ ✁ ✄ � ✁ � ✁ ✞ ✂ ✄ � ✁ ✞ � ✁ ✟ ✁ � ✂ Going further The type of is not informative enough for some of its potential applications. How is related to ? When does return ? An Introduction to Type Theory – p.11/32

  38. � ✝ ✁ ☎ ✂ ✁ ✌ ✓ ✜ ☛ ✔ ☛ � ✁ ✜ ✓ ✂ ✁ ✌ ✝ ✔ � ☎ ✁ ✌ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✁ ✌ ✝ ✁ ✄ ✂ ✁ improved. let ☞✂✁ An Introduction to Type Theory – p.12/32

  39. An Introduction to Type Theory – p.12/32 ✛ ✓ � ✁ ✛ ✗ ✒ � ✁ ✝ � ✁ ✗ ✁ ✒ ✂ � ✛ ✝ ✂ ✁ ✝ ✄ ✁ ✝ ✂ ✌ ✁ ✁ ✔ ✝ ✆ � ✓ � ✁ ✛ ✗ ✒ � ✝ ✝ � � ✒ ✒ ✄ ✄ ✁ � ✄ ✝ ✔ � � ✛ ✝ ☎ ✁ � ☛ ☎ ✌ ✁ ✂ ✄ ✁ ✌ ✁ ✁ ✂ � ✛ ✝ ✂ ✁ ✝ ✄ ✂ ✗ ✂ ✌ ✌ ✒ � ✄ ✁ ✝ ✄ � ✔ ✝ ✓ ✁ ✔ ✝ ✂ ✓ ✜ ✜ ✁ � ✁ ☛ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ where let ☞✂✁ data

  40. An Introduction to Type Theory – p.12/32 ✌ ✝ � � ✒ ✒ ✄ ✄ ✁ � ✄ ✝ ✔ ✝ ✁ � ✂ ✓ � ✁ ✛ ✗ ✒ � ✁ ✝ � ✁ ✛ ✗ ✁ ✒ ✂ ☎ ✝ � ✁ ✛ ✗ ✒ � ✁ ✝ � ✁ � ✝ ✑ ✗ ✂ ✄ ✁ ✝ ✄ � ✔ ✝ ✆ � ✓ � ✁ ✛ ✁ � � ✁ ✛ ☛ ✜ ✓ ✌ ✁ ✂ ☎ ✁ � ☛ ☎ ✌ ✂ � ✄ ✁ ✝ ✌ ✁ ✂ � ✛ ✝ ✂ ✁ ✝ ✄ ✂ ✔ ✝ ✁ ✄ ✝ ✂ ✁ ✝ ✄ ✁ ✝ � ✁ ✛ ✗ ✒ � ✒ ✔ ✁ ✜ ✓ ✝ ✄ � ✂ ✁ ✝ ✌ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ☞✂✁ let where let ☞✂✁ data

  41. An Introduction to Type Theory – p.12/32 ✁ ✄ ✒ ✒ � � ✝ � ✁ ✒ ✗ ✛ ✁ � ✓ ✄ � ✆ � ✁ � ✒ ✗ ✛ ✁ ✓ ✄ ✂ ✁ ✌ ✝ ✔ ✝ � ✝ � ✝ ✁ � ✝ ✂ ✑ ☎ � ✗ ✁ � ✝ � ✁ ✂ ✛ ✒ ✔ ✑ � ✄ ✝ ✁ ✄ ✂ ☎ � ✝ � ✁ � ✝ ✁ ✁ � ✁ ✌ � ✔ ✝ ☛ ✜ ✓ ✌ ✁ ✂ ☎ ✁ � ☛ ☎ ✁ ✜ ✛ ✂ ✄ ✝ ✁ ✂ ✝ � ✂ ✂ ✁ ✌ ✝ ✁ ✄ ✛ ✁ ✓ ✝ ✛ ✁ � ✝ ✁ ✄ ✁ ✒ ✂ ✝ ✛ � ✂ ✒ ✗ ✂ ✗ ✝ � ✁ ✌ ✝ ✔ � ✄ ✝ ✁ ✄ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ☞✂✁ let where let ☞✂✁ data

  42. An Introduction to Type Theory – p.12/32 ✆ ✗ ✛ ✁ � ✓ � ✝ � ✔ � ✄ ✝ ✁ ✄ ✂ ✒ ✁ ☎ ✄ ✓ ✂ ✁ ✌ ✝ ✔ ✝ � ✝ ✁ ✄ ✄ ✒ ✒ � � ✑ ✝ ✁ ✁ ✁ ✂ ✂ ✑ ☎ ✝ � ✓ ✝ ✜ � ✔ ✝ � ✁ ✂ � ☎ � ✛ ✁ � ✝ ✁ � ✒ ✗ ✁ ✁ � ✝ ✂ ✑ ☎ ✝ � ✁ � ✛ ☛ ✁ ☎ ✂ ✁ ✌ ✓ ✜ ✝ ☛ ✔ � ✁ ✜ ✓ ✂ ✁ � ☎ ✝ � ✂ ✄ ✝ ✁ ✂ ✝ ✛ ✂ ✌ ✁ ✌ ✝ ✁ ✄ ✂ ✁ ✗ ✌ ✔ ✒ ✁ ✂ ✝ ✛ � ✂ ✗ ✄ ✛ ✁ � ✝ ✁ � ✒ ✝ � ✁ ✁ � � ✁ ✛ ✄ ✗ ✒ � ✝ ✄ ✝ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ☞✂✁ let where let ☞✂✁ data

  43. An Introduction to Type Theory – p.12/32 ✄ � ✓ � ✆ ✝ ✔ � ✝ ✛ ✁ ✄ ✂ ✑ ☎ ✝ � ✁ ✗ � ✄ ✌ ✝ ✔ ✝ ✄ � ✁ ✄ ✒ ✒ ✒ � � ✝ ✁ � ✁ ✝ ✂ ✁ ☎ ✝ ✂ ✑ ☎ ✝ � ✓ ✒ ✜ � ✔ ✝ � ✁ ✂ � ✒ ✁ ✂ � ✒ ✗ ✛ ✁ � ✝ ✑ ✄ ☎ ✝ � ✁ ☎ ✝ � ✁ ✁ � ✓ ✝ ☎ ✂ ✁ ✌ ✓ ✜ ☛ ✔ � � ✁ ✜ ✓ ✂ ✁ ✌ ✁ ☛ ✔ � ✂ ✄ ✝ ✁ ✂ ✝ ✛ ✂ ☎ ✁ ✌ ✝ ✁ ✄ ✂ ✁ ✌ � ✝ ✁ ✁ � ✛ � ✂ ✒ ✗ ✛ � ✁ ✝ ✁ � ✒ ✗ ✛ ✁ ✂ ✝ ✝ ✛ ✝ ✄ ✄ � ✄ ✒ ✗ � ✁ ✝ ✁ ✁ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  44. An Introduction to Type Theory – p.12/32 ✁ ✂ ✑ ☎ ✝ � ✁ � ✝ � ✁ ✒ ✗ ✛ ✁ � ✝ ✂ ✑ ✄ ✝ ✝ ✒ ✄ ✒ ✒ � � ✝ ✁ � ✗ ✄ ✛ ✁ � ✓ � ✆ ✝ ✔ � ☎ � ✁ ✜ ✂ ✂ ✑ ☎ ✝ � ✁ ✓ � � ✔ ✓ ✜ ✝ ✔ � ✁ ✂ ✁ ☎ ✁ ☎ ☎ ✝ � ✁ ✄ ✒ ✒ � ✝ ✔ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✁ � � � ✂ ✁ ✌ ✓ ✜ ☛ ✝ ✔ ✁ ✁ ✜ ✓ ✂ ✁ ✌ ✝ ✔ � ☎ � ✁ ✂ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✁ ☛ ✌ ✝ ✁ ✄ ✂ ✁ ✌ ☎ ✝ ✄ ✄ ✒ ✄ ✛ ✁ � ✝ ✁ � ✗ ✒ ✛ ✁ � ✓ ✂ ✁ ✌ ✝ ✗ ✂ � ✝ ✄ � ✝ ✒ ✗ ✛ ✁ � ✔ ✁ ✄ ✝ ✁ ✂ ✝ ✛ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  45. An Introduction to Type Theory – p.12/32 ✛ � ✁ � ✝ ✁ � ✒ ✗ ✁ ☎ � ✝ ✂ ✑ ☎ ✝ � ✁ ☎ ✝ ✑ � � � � ✝ ✁ � ✒ ✗ ✛ ✁ ✓ ✂ � ✆ ✝ ✔ � ✄ ✝ ✁ ✄ ✝ ✁ ✒ ✓ ☎ ☛ ✂ ✑ ☎ ✝ � ✁ ✜ ✁ � ✔ ✓ ✜ ✝ ✔ � ✁ ✂ � ✛ ✄ � ✒ ✒ � ☎ ✝ ✂ ✑ ☎ ✝ ✁ ✗ ✓ ✜ � ✔ ☎ � ✁ ✂ ✒ ✁ � ✄ ✁ ✁ ✌ ✓ ✜ ☛ ✝ ✔ � ✜ ☎ ✓ ✂ ✁ ✌ ✝ ✔ � ✄ ✝ ✂ ✁ ✄ ✂ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✁ � ✌ ✝ ✁ ✄ ✂ ✁ ✌ ☎ ☛ ✄ ✁ ✒ ✛ � ✝ ✁ � ✒ ✁ ✗ ✁ ✛ � � ✓ ✂ ✁ ✌ ✝ ✔ ✁ ✗ ✄ ✒ � ✒ ✗ ✛ ✁ � ✝ ✁ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✝ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  46. An Introduction to Type Theory – p.12/32 ☎ � ✒ ✗ ✛ ✁ � ✝ ✂ ✑ ✝ ✝ � ✁ ☎ ✝ � ✁ ✄ ✒ ✒ ✁ � ☎ ✝ � ✒ ✗ ✛ ✁ � ✓ � ✆ ✔ ✁ � ✄ ✝ ✁ ✄ ✂ ✑ ☎ ✝ � � ✝ ✝ � ✁ ✓ ✜ � ✔ ✓ ✜ ✝ ✔ ✂ ✝ ✑ ☎ ✝ � ✁ � ✝ � ✁ ✂ � ☎ ✂ ☎ ✑ ☎ ✝ � ✁ ✓ ✜ � ✔ � ✑ ✁ ✂ ✒ ✗ ✛ ✁ � ☎ ☛ ✂ ✁ � � ✜ ✌ ✓ ✜ ☛ ✝ ✔ � ✁ ✓ ✂ ✂ ✁ ✌ ✝ ✔ � ✄ ✝ ✁ ✁ ☎ � ✁ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✌ ✁ ✝ ✁ ✄ ✂ ✁ ✌ ☎ ☛ � ✄ ✁ ✒ ✝ ✗ ✗ ✛ ✁ � ✓ ✂ ✁ ✌ ✔ ✁ ✝ ✄ � ✁ ✄ ✄ ✒ ✒ � � ✒ ✝ ✛ � ✝ ✁ ✄ � ✝ ✁ ✂ ✝ ✛ � ✂ ✒ ✗ ✛ ✁ ✁ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  47. An Introduction to Type Theory – p.12/32 ✂ ✔ ☎ � ✁ ✂ ✒ ✗ ✛ ✁ � ☎ ☛ ✑ ✜ ☎ ✝ � ✁ ✓ ✜ � ✔ ✓ ✜ ✝ ✔ � � ✓ ✑ ☎ � ✒ ✗ ✛ ✁ � ✝ ✂ ✑ ☎ ✝ � ✁ ✝ ✁ � ✁ ✄ ✒ ✒ � ☎ ✝ ✂ ✑ ☎ ✝ � ✂ ☎ ✁ ✁ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✔ ✓ ✂ ✌ ✁ ✝ ✔ ✕ ✂ ✒ ✗ ✛ ✁ � ✝ � ✁ ✂ ✂ � ✝ ✔ � ✁ � ✝ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✓ ✝ ✜ ✓ � ✆ ✝ ✔ ✔ ✕ ✄ ✒ ✒ � � ✁ � � ✁ � ✁ ✜ ✓ ✂ ✁ ✌ ✝ ✔ � ✄ ✝ ✄ ✝ � ✒ ✗ ✛ ✁ � ✝ ✁ ✄ ✝ ✁ ✁ ✔ ☛ ✛ ✁ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✁ ✌ ✝ ✄ ✜ ✂ ✁ ✌ ☎ ☛ � ✁ ☎ ✂ ✁ ✌ ✓ ✝ ✂ � � ✂ � � ✝ ✁ � ✒ ✗ ✛ ✁ � ✓ ✆ ✒ ✝ ✔ � ✄ ✝ ✁ ✄ ✂ ✑ ☎ ✝ � ✒ ✝ ✄ ✓ ✒ ✗ ✛ ✁ � ✝ ✁ � ✒ ✗ ✛ ✁ ✄ � ✔ ✂ ✁ ✌ ✁ ✝ � ✝ ✄ ☞✂✁ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  48. An Introduction to Type Theory – p.12/32 ✓ ✒ ✗ ✛ ✁ � ☎ ☛ ✂ ✑ ☎ ✝ � ✁ ✜ ✁ � ✔ ✓ ✜ ✝ ✔ � ✂ ✑ ☎ ✝ � ✁ ✂ � ✝ ✄ ✁ � ✝ ✂ ✑ ☎ ✝ � ✁ ☎ ✝ � ✁ ✒ ☎ ✒ � ☎ ✝ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✔ � ✂ ✗ ✁ ✝ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✔ ✓ ✂ ✌ � ✝ ✔ ✕ ✂ ✒ ✗ ✛ ✁ � ✝ � ✁ ✂ ✔ ✜ ✑ ✝ ☎ ✝ � ✁ ✓ ✜ � ✔ ✓ ✜ ✓ � ✆ ✔ ✓ ✔ ✕ ✄ ✒ ✒ � � ✝ � ✁ ✄ ✒ ✒ � ✁ � ✒ ✄ ✁ ✜ ✓ ✂ ✁ ✌ ✝ ✔ � ✄ ✝ ✁ � ✔ ✒ ✗ ✛ ✁ � ✝ ✁ ✄ ✝ ✁ ✂ � ✛ � ✝ ✂ ✁ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✁ ✌ ✝ ✄ ☛ ✂ ✁ ✌ ☎ ☛ � ✁ ☎ ✂ ✁ ✌ ✓ ✜ � ✝ ✒ ✔ ✗ ✁ � ✒ ✗ ✛ ✁ � ✓ � ✆ ✝ � � ✄ ✝ ✁ ✄ ✂ ✑ ☎ ✝ � ✁ � ✝ ✁ � ✝ ✒ ✗ ✁ ✂ ✓ � ✁ ✛ ✒ ✌ � ✁ ✝ � ✁ ✛ ✒ ✛ ✝ ✔ ✝ ✄ � ✄ ✁ ✄ ☞✂✁ ✝ ☎✄ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  49. An Introduction to Type Theory – p.12/32 ✂ ✑ ☎ ✝ � ✁ ✓ ✜ � ✔ ✓ ✜ ✝ ✔ � ✑ ☛ ☎ ✝ � ✁ � ✝ ✂ ✑ ☎ ✝ � ✁ ✓ ✜ ✂ ☎ ✔ ☎ � ✁ ☎ ✝ � ✁ ✄ ✒ ✒ � ☎ ✝ ✂ ✑ ✝ � � ✁ ✓ ✜ � ✔ ☎ � ✁ ✂ ✒ ✗ ✛ ✁ � ✓ ✁ � ✓ ✂ ✁ ✌ ✝ ✔ ✕ ✂ ✒ ✗ ✛ ✁ � ✝ ✁ � ✂ ✒ ✗ ✛ ✁ ✓ ✜ � ✔ ✓ ✜ ☛ ✝ ✔ ✔ ✜ ✜ ✁ ✓ � ✆ ✝ ✔ ✔ ✕ ✄ ✒ ✒ � � ✝ � ✄ ✓ ✒ ✒ � ✓ ✜ � ✔ ✝ ✂ ✑ ☎ ✝ � ✁ ✝ � ✑ ✗ ✓ ✂ ✁ ✌ ✝ ✔ � ✄ ✝ ✁ ✄ � ✒ ✛ ✁ ✁ � ✝ ✁ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✂ ✗ ✜ � ✁ ✄ ✂ ✄ ✝ ✁ ✂ ✝ ✛ � ✂ ✁ ✌ ✝ ✁ ✂ ✔ ✁ ✌ ☎ ☛ � ✁ ☎ ✂ ✁ ✌ ✓ ✜ ☛ ✝ ✛ ✒ � ✂ ✝ ✛ ✁ � ✓ � ✆ ✝ ✔ � ✄ ✝ ✁ ✄ ✑ � ☎ ✝ � ✁ � ✝ ✁ � ✒ ✗ ✛ ✁ � ✝ ✒ ✗ ✁ ✝ ✁ � ✒ ✗ ✛ ✁ � ✓ ✂ ✁ ✌ ✝ ✔ ✝ ✄ � ✄ � � ✒ ✒ ✄ ☎ ✁ ☞✂✁ ✝ ☎✄ ✝ ☎✄ improved. ☞✂✁ ✝ ☎✄ ✝ ☎✄ ☞✂✁ let where let ☞✂✁ data

  50. Definitional equality An Introduction to Type Theory – p.13/32

  51. � ✡ � ✟ ✁ ✡ � ✆ ✁ ✟ ✡ ✁ � ✡ � � ✆ ✄ ✂ ✞ ✁ � ✁ ✁ Definitional equality The typing of depends on the equations: An Introduction to Type Theory – p.13/32

  52. � ✡ � ✟ ✁ ✡ � ✆ ✁ ✟ ✡ ✁ � ✡ � � ✆ ✄ ✂ ✞ ✁ � ✁ ✁ Definitional equality The typing of depends on the equations: This equations need to be true definitionally . An Introduction to Type Theory – p.13/32

  53. � ✟ � ✆ ✡ � ✁ � ✟ ✁ ✡ � ✆ ✁ � ✡ ✡ ✁ ✡ � � ✡ ✄ ✂ ✞ ✁ � ✁ � Definitional equality The typing of depends on the equations: This equations need to be true definitionally . If we need we have to use propositional equality. An Introduction to Type Theory – p.13/32

  54. Propositional equality An Introduction to Type Theory – p.14/32

  55. ✄ � ✄ ✁ � ✁ ✂ ✄ ✄ ☎ � � ✄ ✄ ✄ ✂ ✄ � ✄ ✄ ☎ ✄ ✂ ✄ Propositional equality data where An Introduction to Type Theory – p.14/32

  56. An Introduction to Type Theory – p.14/32 � � ✆ ✡ ✟ � ☎ � ✂ � � ✁ � ✁ ✌ ☞ � ☎ ✡ � � � ✁ � ✁ ✌ ☞ ✁ � ✁ ✡ � � ✡ ☎ � � ✂ � ✁ � ✂ ✄ ☎ ✁ � ✁ ✂ ✄ ✄ ✄ ✄ � � ✄ ☎ ✂ ✄ � ✡ ✄ ✄ � � � � ✡ ✄ ✡ ✂ ✂ � ✁ ✂ ☛ ✄ ✡ ✄ ✄ ✄ Propositional equality where data �✂✁ let

  57. An Introduction to Type Theory – p.14/32 ✌ ✌ ✂ ✄ ✁ � � ✄ ✄ � ✁ � ✁ ☞ ✂ ✁ � ✁ � ✡ � ✡ ☎ � � ✂ � ✁ ☎ ✄ � ✆ ✂ ✌ ☞ ✂ ✁ ✆ ✄ ✁ � ✁ � ✁ ✟ ✁ ✁ ✟ � ✁ ✄ ✂ ✁ � ✁ ✟ ✆ ✁ ✟ ✄ � � ✡ ✄ ☛ ✄ ✡ ✄ � ✄ ✄ ✄ ✁ � ✁ ✂ ✄ ✁ ☎ ✄ � � ✄ ✂ ✄ � ✄ ✄ ☎ ✄ ✂ ✂ ✂ � ✌ � ✆ ✡ ✟ � ☎ � � ✂ � ✁ � ✁ ☞ � � ✡ ✄ ✡ � � ✡ ✂ � � ☎ Propositional equality where data �✂✁ let let

  58. � Problems with An Introduction to Type Theory – p.15/32

  59. � Problems with Programs cluttered with coercions. An Introduction to Type Theory – p.15/32

  60. � Problems with Programs cluttered with coercions. Programming requires theorem proving. An Introduction to Type Theory – p.15/32

  61. ✄ ☎ ✝ � ✂ ✁ � ✂ � ✆ ✂ � ✂ ✄ ✄ ✄ ✂ ✌ ✂ ✄ ✁ ✄ � ✄ � � ✁ ✁ Problems with Programs cluttered with coercions. Programming requires theorem proving. Equality on functions is not extensional, i.e. let cannot be derived. An Introduction to Type Theory – p.15/32

  62. Solutions ? An Introduction to Type Theory – p.16/32

Recommend

Introduction to AdS/CFT D-branes Type IIA string theory: Dp-branes p even (0,2,4,6,8) Type IIB

Introduction to AdS/CFT D-branes Type IIA string theory: Dp-branes p even (0,2,4,6,8) Type IIB

Introduction to AdS/CFT D-branes Type IIA string theory: Dp-branes p even (0,2,4,6,8) Type IIB string theory: Dp-branes p odd (1,3,5,7,9) 10D Type IIB two parallel D3-branes low-energy effective description: Higgsed N = 4 SUSY gauge theory Two

971 views • 51 slides
An Introduction to Type Theory Part 2 Tallinn, September 2003

An Introduction to Type Theory Part 2 Tallinn, September 2003

An Introduction to Type Theory Part 2 Tallinn, September 2003 http://www.cs.nott.ac.uk/txa/tallinn/ Thorsten Altenkirch University of Nottingham An Introduction to Type Theory p.1/46 Plan of the course 1. Intuitionistic logic from a

1.84k views • 169 slides
An Invitation to Homotopy Type Theory Tingxiang Zou Type Theory Formal Systems: Churchs

An Invitation to Homotopy Type Theory Tingxiang Zou Type Theory Formal Systems: Churchs

An Invitation to Homotopy Type Theory Tingxiang Zou Type Theory Formal Systems: Churchs simply typed lambda calculus (1940); Martin L ofs dependent type theory (1971-1984) Origin: Russells theory of types The world is

848 views • 12 slides
Cubical Type Theory Goal: provide a computational justification for Homotopy Type Theory and

Cubical Type Theory Goal: provide a computational justification for Homotopy Type Theory and

Cubical Type Theory: a constructive interpretation of the univalence axiom Anders M ortberg Inria Sophia-Antipolis TTT: Type Theory Based Tools January 15, 2017 - 1 / 39 Cubical Type Theory Goal: provide a computational justification for

744 views • 39 slides
Formalizing type theory in type theory using nominal techniques Ulrik Buchholtz TU Darmstadt

Formalizing type theory in type theory using nominal techniques Ulrik Buchholtz TU Darmstadt

Formalizing type theory in type theory using nominal techniques Ulrik Buchholtz TU Darmstadt HoTT/UF Workshop, Oxford, September 9, 2017 Motivation 1 Preliminaries 2 Nominal sets and types 3 Formalizing type theory 4 Conclusion 5

831 views • 40 slides
Type Theory and Coq Herman Geuvers Lecture: Simple Type Theory ` a la Curry: assigning types to

Type Theory and Coq Herman Geuvers Lecture: Simple Type Theory ` a la Curry: assigning types to

Type Theory and Coq Herman Geuvers Lecture: Simple Type Theory ` a la Curry: assigning types to untyped terms, principal type algorithm 1 Overview of todays lecture Simple Type Theory ( ) ` a la Curry (versus ` a la Church)

449 views • 29 slides
Formalising semantics of dependent type theory in dependent type theory (work in progress)

Formalising semantics of dependent type theory in dependent type theory (work in progress)

Formalising semantics of dependent type theory in dependent type theory (work in progress) Peter LeFanu Lumsdaine joint work with H akon Gylterud, Erik Palmgren DMV Hamburg, 25 September 2015 1 / 19 Modelling DTT Early models of

389 views • 19 slides
Partiality and Non-Termination in Type Theory Niccol` o Veltri Department of Software Science

Partiality and Non-Termination in Type Theory Niccol` o Veltri Department of Software Science

Partiality and Non-Termination in Type Theory Niccol` o Veltri Department of Software Science Tallinn University of Technology EWSC17, 08 March 2017 Introduction In type theory, all functions are total. ((1 0) + proposition as

460 views • 11 slides
An Introduction to Homotopy Type Theory Morteza Moniri Department of Mathematics Shahid

An Introduction to Homotopy Type Theory Morteza Moniri Department of Mathematics Shahid

An Introduction to Homotopy Type Theory Morteza Moniri Department of Mathematics Shahid Beheshti University Mathematical Logic and its Applications September 4, 2019 Arak University of Technology Morteza Moniri Homotopy Type Theory 1/21

708 views • 57 slides
Lecture 3: Homotopical models of type theory Nicola Gambino School of Mathematics University of

Lecture 3: Homotopical models of type theory Nicola Gambino School of Mathematics University of

Lecture 3: Homotopical models of type theory Nicola Gambino School of Mathematics University of Leeds Young Set Theory Copenhagen June 14th, 2016 1 What happened yesterday? Type theory the type theory T Extensional vs intensional

639 views • 28 slides
Homotopy and Directed Type Theory: a Sample Dan Doel October 24, 2011 Type Theory Overview

Homotopy and Directed Type Theory: a Sample Dan Doel October 24, 2011 Type Theory Overview

Homotopy and Directed Type Theory: a Sample Dan Doel October 24, 2011 Type Theory Overview Judgments ctx A type M : A Families , x : A B ( x ) type Inference 1 J 1 2 J 2 Type Theory Overview

415 views • 27 slides
Algebraic simple type theory A polynomial approach Nathanael Arkor & Marcelo Fiore

Algebraic simple type theory A polynomial approach Nathanael Arkor & Marcelo Fiore

Algebraic simple type theory A polynomial approach Nathanael Arkor & Marcelo Fiore Department of Computer Science and Technology University of Cambridge Category Theory 2019 What is a type theory? What is a type theory? system of

1.29k views • 65 slides
Type-theory of acyclic recursion and its calculi Roussanka Loukanova Stockholm University, Sweden

Type-theory of acyclic recursion and its calculi Roussanka Loukanova Stockholm University, Sweden

Introduction to Type-Theory of Algorithms Reduction Rules Current and Future Work Some References Type-theory of acyclic recursion and its calculi Roussanka Loukanova Stockholm University, Sweden Second Workshop on Mathematical Logic and its

538 views • 29 slides
Constructive Proofs and Program Extraction Christoph Kreitz 1. Type Theory vs. Set Theory 2.

Constructive Proofs and Program Extraction Christoph Kreitz 1. Type Theory vs. Set Theory 2.

Constructive Proofs and Program Extraction Christoph Kreitz 1. Type Theory vs. Set Theory 2. Overview of the Nuprl System 3. Proofs of the Integer Square Root Problem What distinguishes Type Theory from Set Theory? n r r 2 n

800 views • 42 slides
Universes and the limits of Martin-Lf type theory Michael Rathjen School of Mathematics

Universes and the limits of Martin-Lf type theory Michael Rathjen School of Mathematics

Universes and the limits of Martin-Lf type theory Michael Rathjen School of Mathematics University of Leeds Russell08 Proof Theory meets Type Theory Swansea, March 15, 2008 U NIVERSES AND THE LIMITS OF M ARTIN -L F TYPE THEORY U NIVERSES

837 views • 39 slides
Introduction to Type Theory February 2008 Alpha Lernet Summer School Piriapolis, Uruguay Herman

Introduction to Type Theory February 2008 Alpha Lernet Summer School Piriapolis, Uruguay Herman

Introduction to Type Theory February 2008 Alpha Lernet Summer School Piriapolis, Uruguay Herman Geuvers Nijmegen & Eindhoven, NL Lecture 3: Polymorphic Type Theory: Full polymorphism and ML style polymorphism 1 Why Polymorphic

826 views • 27 slides
CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type

CS 671 Automated Reasoning Extending Nuprls Type Theory 1. Design Decisions for Nuprls Type Theory 2. Product, Union, and List Types 3. The Curry-Howard Isomorphism, formally 4. Empty and Unit Types Design Decisions for Nuprls Type Theory

556 views • 8 slides
Homotopy canonicity of homotopy type theory Christian Sattler jww. Chris Kapulkin University of

Homotopy canonicity of homotopy type theory Christian Sattler jww. Chris Kapulkin University of

Homotopy canonicity of homotopy type theory Christian Sattler jww. Chris Kapulkin University of Nottingham Aug 16, 2019 Introduction: constructivity of MLTT Martin-Lf type theory (MLTT) is a constructive system: existence proofs are

1.58k views • 62 slides
Set Theory in Type Theory Gert Smolka Saarland University Types 2015, Tallinn, May 19, 2015 1 /

Set Theory in Type Theory Gert Smolka Saarland University Types 2015, Tallinn, May 19, 2015 1 /

Set Theory in Type Theory Gert Smolka Saarland University Types 2015, Tallinn, May 19, 2015 1 / 15 How would you teach set theory to students who are familiar with type theory and proof assistants? Classical set theory with

277 views • 15 slides
Programming in Homotopy Type Theory Dan Licata Institute for Advanced Study Joint work with

Programming in Homotopy Type Theory Dan Licata Institute for Advanced Study Joint work with

Programming in Homotopy Type Theory Dan Licata Institute for Advanced Study Joint work with Robert Harper 1 Dependent Type Theory 2 Dependent Type Theory Basis of proof assistants (Agda, Coq, NuPRL) Formalization of math Certified

1.75k views • 111 slides
Seifert-van Kampen Theorem in Homotopy Type Theory [ Toronto version ] Michael Shulman @ U of

Seifert-van Kampen Theorem in Homotopy Type Theory [ Toronto version ] Michael Shulman @ U of

Seifert-van Kampen Theorem in Homotopy Type Theory [ Toronto version ] Michael Shulman @ U of San Diego * Favonia @ CMU 1 Homotopy Type Theory * Type theory <-> topology - types ~= spaces - terms ~= points - functions ~= continuous

794 views • 43 slides
Two Set-based Implementations of Quotients in Type Theory Niccol` o Veltri Institute of

Two Set-based Implementations of Quotients in Type Theory Niccol` o Veltri Institute of

Two Set-based Implementations of Quotients in Type Theory Niccol` o Veltri Institute of Cybernetics, Tallinn Theory Days in Rogosi, 08 January 2015 Quotients in Intensional Type Theory (TT) In TT (a framework for constructive mathematics)

571 views • 19 slides
Dependent type theory as the initial category with families Internship at Chalmers University of

Dependent type theory as the initial category with families Internship at Chalmers University of

Dependent type theory as the initial category with families Internship at Chalmers University of Technology, with Peter Dybjer and Thierry Coquand Simon Castellan December 8, 2014 Introduction Initiality : a term of ring theory (eg. 1 + 1)

619 views • 26 slides
Eta-equalities in Martin-L of type theory Ansten Klev Czech Academy of Sciences Mathematical

Eta-equalities in Martin-L of type theory Ansten Klev Czech Academy of Sciences Mathematical

Eta-equalities in Martin-L of type theory Ansten Klev Czech Academy of Sciences Mathematical Logic and its Applications Kanazawa, 9 March 2018 : 1 Martin-L of type theory I Forms of judgement : type = : type a : a = b :

915 views • 13 slides

More recommend