agda   518

« earlier    

Introduction to Univalent Foundations of Mathematics with Agda
Introduction to Univalent Foundations of Mathematics with Agda. ~ Martín Hötzel Escardó.
HoTT  math  ITP  Agda  from twitter_favs
2 days ago by skchrko
Quantifiers in Agda
Quantifiers in Agda. ~ Vladimir Ciobanu.
Agda  ITP  from twitter_favs
29 days ago by skchrko
Programming Language Foundations in Agda
This book is an introduction to programming language theory using the proof assistant Agda.

Comments on all matters—organisation, material to add, material to remove, parts that require better explanation, good exercises, errors, and typos—are welcome. The book repository is on GitHub. Pull requests are encouraged.

Front matter
Dedication
Preface
Part 1: Logical Foundations
Naturals: Natural numbers
Induction: Proof by induction
Relations: Inductive definition of relations
Equality: Equality and equational reasoning
Isomorphism: Isomorphism and embedding
Connectives: Conjunction, disjunction, and implication
Negation: Negation, with intuitionistic and classical logic
Quantifiers: Universals and existentials
Decidable: Booleans and decision procedures
Lists: Lists and higher-order functions
Part 2: Programming Language Foundations
Lambda: Introduction to Lambda Calculus
Properties: Progress and Preservation
DeBruijn: Inherently typed De Bruijn representation
More: Additional constructs of simply-typed lambda calculus
Bisimulation : Relating reductions systems
Inference: Bidirectional type inference
Untyped: Untyped lambda calculus with full normalisation
Backmatter
Acknowledgements
Fonts: Test page for fonts
Statistics: Line counts for each chapter
Related
A paper describing the book appears in SBMF.
Courses taught from the textbook:
Philip Wadler, University of Edinburgh, 2018
David Darais, Un
agda  proofs  programming  book 
december 2018 by dicewitch

« earlier    

related tags

applicative  benjamin_pierce  blogs  book  books  calculus  cat  category-theory  categorytheory  checking  cic  coc  code  coinduction  compilers  computer-science  computerscience  copatterns  coq  courses  cryptocurrency  cs  cubical  dafny  data  dependent-types  dependent.types  dependent  dependenttype  dev  development  documentation  ebook  emacs  ethereum  evm  f  folds  formal-methods  formal-proofs  formalization  fp  free  fstar  functional.programming  functional  functionalprogramming  funtionalprogramming  generics  haskell  hereditary  hillel-wayne  hole  hott  idioms  idris  implementation  intro  ip  itp  itt  lambda  lambda_calculus  language  languages  learning  linear  logic  logical  martin-löf  math  mathematics  modal  nested-types  normalization  notation  object  oriented  paper  pdf  phillip_wadler  pl-design  pl-theory  pl  programming-languages  programming  programming_language  programminglanguages  proof  proofs  prover  proving  relation  rust  smart-contracts  software  software_foundations  stlc  structures  substitution  substructural  symbols  system  systemt  tapl  tdd  testing  theorem-prover  theorem-proving  theorem.prover  theorem  theory  tla+  tutorial  type-theory  type  types  typetheory  unicode  univalence  verification  video  wen_kokke  λcalculus 

Copy this bookmark:



description:


tags: