ALF (proof assistant)

From Wikipedia, the free encyclopedia
Jump to: navigation, search
ALF can also refer to Algebraic Logic Functional programming language.

ALF ("Another logical framework") is a structure editor for monomorphic Martin-Löf type theory developed at Chalmers University. It is a predecessor of the Alfa, Agda, Cayenne and Coq proof assistants and dependently typed programming languages. It was the first language to support inductive families and dependent pattern matching.[1][2]

References[edit]

  1. ^ Thierry Coquand (1992). "Pattern Matching with Dependent Types". In Bengt Nordström, Kent Petersson, and Gordon Plotkin (editors), Electronic Proceedings of the Third Annual BRA Workshop on Logical Frameworks (Båstad, Sweden).
  2. ^ Thorsten Altenkirch, Conor McBride and James McKinna (2005). "Why Dependent Types Matter".

Further reading[edit]

External links[edit]