Automata and Formal Languages - CM0081 Introduction to Agda

Transcription

1 Automata and Formal Languages - CM0081 Introduction to Agda Andrés Sicard-Ramírez Universidad EAFIT Semester

2 Introduction Curry-Howard correspondence Dependent types Constructivism Martin-Löf s type theory Dependently typed functional programming language Agda Dependently typed interactive proof assistant 2/46

3 Constructive Logic Troelstra and van Dalen [1988, p. 8]: The preceding examples of non-constructive proofs show that the natural constructive reading of A or B and xa(x) as we can decide between A and B and we can construct an x such that A(x) respectively does not agree with all the laws of the classical logic. 3/46

4 Constructive Logic Natural deduction rules A A (Ax) 4/46

5 Constructive Logic Natural deduction rules A A (Ax) Γ, A B ( I) Γ A B Γ A Γ A B ( E) Γ B 5/46

6 Constructive Logic Natural deduction rules A A (Ax) Γ, A B ( I) Γ A B Γ A Γ A B ( E) Γ B Γ A Γ B ( I) Γ A B Γ A B ( E1 ) Γ A Γ A B ( E2 ) Γ B 6/46

7 Constructive Logic Natural deduction rules A A (Ax) Γ, A B ( I) Γ A B Γ A Γ A B ( E) Γ B Γ A Γ B ( I) Γ A B Γ A B ( E1 ) Γ A Γ A B ( E2 ) Γ B Γ A Γ A B ( I 1 ) Γ B Γ A B ( I 2 ) Γ, A C Γ, B C A B ( E) Γ C 7/46

8 Constructive Logic Natural deduction rules A A (Ax) Γ, A B ( I) Γ A B Γ A Γ A B ( E) Γ B Γ A Γ B ( I) Γ A B Γ A B ( E1 ) Γ A Γ A B ( E2 ) Γ B Γ A Γ A B ( I 1 ) Γ B Γ A B ( I 2 ) Γ, A C Γ, B C A B ( E) Γ C ( E) A 8/46

9 Constructive Logic Natural deduction rules A A (Ax) Γ, A B ( I) Γ A B Γ A Γ A B ( E) Γ B Γ A Γ B ( I) Γ A B Γ A B ( E1 ) Γ A Γ A B ( E2 ) Γ B Γ A Γ A B ( I 1 ) Γ B Γ A B ( I 2 ) Γ, A C Γ, B C A B ( E) Γ C Abbreviation: A A ( E) A 9/46

10 Constructive Logic Example (Ax) B A B A ( E2 ) B A A B A A B (Ax) B A B A ( E1 ) B A B ( I) 10/46

11 What is a Type? Example Mathematics f Z {True, False} f(x) =... Java int f(boolean b) {... } Haskell f Bool Int f b =... 11/46

12 What is a Type? Example V = v V (type variables) T = V C N 0 N 1 T T T T T + T (constant types) (the empty type) (the unit type) (function types) (product types) (disjoint union types) 12/46

13 What is a Type? A type is a set. 13/46

14 What is a Type? A type is a set. Types as ranges of significance of propositional functions [Russell 1908]. Types are domains of predicates. 14/46

15 What is a Type? A type is a set. Types as ranges of significance of propositional functions [Russell 1908]. Types are domains of predicates. Example. The mathematical induction principle P (0) ( x.p (x) P (succ(x))) x.p (x) make sense only when P is a predicate over natural numbers (i.e., P N {True, False}). 15/46

16 What is a Type? Hoare s Notes on Data Structuring [Hoare 1972, pp ] 16/46

17 What is a Type? Hoare s Notes on Data Structuring [Hoare 1972, pp ] Thus there is a high degree of commonality in the use of the concept of type by mathematicians, logicians and programmers. The salient characteristics of the concept of type may be summarised: 1. A type determines the class of values which may be assumed by a variable or expression. 2. Every value belongs to one and only one type. 3. The type of a value denoted by any constant, variable, or expression may be deduced from its form or context, without any knowledge of its value as computed at run time. Continued on next slide 17/46

18 What is a Type? Hoare s Notes on Data Structuring (continuation) 4. Each operator expects operands of some fixed type, and delivers a result of some fixed type (usually the same). Where the same symbol is applied to several different types (e.g. + for addition of integers as well as reals), this symbol may be regarded as ambiguous, denoting several different actual operators. The resolution of such systematic ambiguity can always be made at compile time. 5. The properties of the values of a type and of the primitive operations defined over them are specified by means of a set of axioms. Continued on next slide 18/46

19 What is a Type? Hoare s Notes on Data Structuring (continuation) 6. Type information is used in a high-level language both to prevent or detect meaningless constructions in a program, and to determine the method of representing and manipulating data on a computer. 7. The types in which we are interested are those already familiar to mathematicians; namely, Cartesian Products, Discriminated Unions, Sets, Functions, Sequences, and Recursive Structures. 19/46

20 What is a Type? A type system is a tractable syntactic method for proving the absence of certain program behaviours by classifying phrases according to the kinds of values they compute. [Pierce 2002, p. 1] 20/46

21 What is a Type? A type system is a tractable syntactic method for proving the absence of certain program behaviours by classifying phrases according to the kinds of values they compute. [Pierce 2002, p. 1] A type is an approximation of a dynamic behaviour that can be derived from the form of an expression. [Kiselyov and Shan 2008, p. 8] 21/46

22 What is a Type? A type system is a tractable syntactic method for proving the absence of certain program behaviours by classifying phrases according to the kinds of values they compute. [Pierce 2002, p. 1] A type is an approximation of a dynamic behaviour that can be derived from the form of an expression. [Kiselyov and Shan 2008, p. 8] Related readings The Triumph of Types: Principia Mathematica s Impact on Computer Science [Constable 2010]. Against a Universal Definition of Type [Petricek 2015]. 22/46

23 What is a Type? BHK (Brouwer, Heyting, Kolmogorov) interpretation: A type is a set, a proposition, a problem and a specification. Type A Term a A Interpretation A is a set a is an element of the set A A A is a proposition A is a problem A is a specification a is a proof (construction) of the proposition A a is a method of solving the problem A a is a program than meets the specification A A is true A is solvable A is satisfiable See, e.g., [Martin-Löf 1984]. 23/46

24 Dependent Types Types that depend on elements of other types. 24/46

25 Dependent Types Types that depend on elements of other types. Example The type of vectors of length n: A 0 = 1, A n+1 = A A n, where 1 is the unit type and is the product type. 25/46

26 Dependent Types B(x): Dependent type for x A 26/46

27 Dependent Types B(x): Dependent type for x A Definition (Dependent function type (Pi types)) B(x) is the type of functions f with f a B(a) if a A. x A Note: If B(x) = B for all x A, then B(x) A B. (Agda notation: (x A) B) x A 27/46

28 Dependent Types Definition (Dependent sum type (Sigma types)) B(x) is the type of pairs (a, b) with a A and b B(a). x A Note: If B(x) = B for all x A, then B(x) A B. x A 28/46

29 The Propositions-as-Types Principle The Curry-Howard isomorphism or the Brouwer - Heyting - Kolmogorov - Schönfinkel - Curry - Meredith - Kleene - Feys - Gödel - Läuchli - Kreisel - Tait - Lawvere - Howard - de Bruijn - Scott - Martin-Löf - Girard - Reynolds - Stenlund - Constable - Coquand - Huet - - isomorphism [Sørensen and Urzyczyn 2006, p. viii]. 29/46

30 The Propositions-as-Types Principle Three correspondence s levels [Wadler 2015]: 1. Propositions as types for each proposition in the logic there is a corresponding type in the programming language and vice versa 30/46

31 The Propositions-as-Types Principle Three correspondence s levels [Wadler 2015]: 1. Propositions as types for each proposition in the logic there is a corresponding type in the programming language and vice versa 2. Proofs as programs for each proof of a given proposition, there is a program of the corresponding type and vice versa 31/46

32 The Propositions-as-Types Principle Three correspondence s levels [Wadler 2015]: 1. Propositions as types for each proposition in the logic there is a corresponding type in the programming language and vice versa 2. Proofs as programs for each proof of a given proposition, there is a program of the corresponding type and vice versa 3. Simplification of proofs as evaluation of programs for each way to simplify a proof there is a corresponding way to evaluate a program and vice versa 32/46

33 The Propositions-as-Types Principle (A proposition is true if the corresponding type is non-empty) Propositional Logic (false) (true) (implication) (conjunction) (disjunction) Dependently typed λ-calculus (empty type) (unit type) (function type) (product type) + disjoint sum type 33/46

34 The Propositions-as-Types Principle II (A proposition is true if the corresponding type is non-empty) First-Order Logic (false) (true) (implication) (conjunction) (disjunction) x.b(x) (universal quantifier) x.b(x) (existential quantifier) Dependently typed λ-calculus (empty type) (unit type) (function type) (product type) + (disjoint sum type) B(x) (dependent fn. type) x A B(x) (dependent sum type) x A 34/46

35 Applications of Dependent Types To carry useful information for programs optimisation. 35/46

36 Applications of Dependent Types To carry useful information for programs optimisation. To reduce the semantic gap between programs and their properties. 36/46

37 Applications of Dependent Types To carry useful information for programs optimisation. To reduce the semantic gap between programs and their properties. The propositions-as-types-principle: Computational interpretation of logical constants. 37/46

38 Applications of Dependent Types To carry useful information for programs optimisation. To reduce the semantic gap between programs and their properties. The propositions-as-types-principle: Computational interpretation of logical constants. Unified programing logics (programs, specification and satisfaction relation). 38/46

39 Dependently Typed Systems (See the Wikipedia article on dependent types for a more complete list) 39/46

40 Dependently Typed Systems (See the Wikipedia article on dependent types for a more complete list) The ALF/Agda family (Gothenburg - Sweden) ALF Agda Alfa. Graphical interface for Agda AgdaLight. Experimental version of Agda Agda 2. Based on Martin-Löf type theory. Direct manipulation of proofs-objects. Backends to Haskell and JavaScript. Written in Haskell. 40/46

41 Dependently Typed Systems Cayenne (Gothenburg - Sweden). An Haskell-like language with dependent types. Written in Haskell. Coq (INRIA - France). Based on the Calculus of Inductive Constructions. Tactic-based. Extraction of programs to Objective Caml, Haskell and Scheme. Written in Objective Caml (with a bit of C). DML (USA). An extension of ML with a restricted form of dependent types. Written in Objective Caml. Epigram 2 (England). Based on a closed type theory. Direct manipulation of proofs-objects. The language is in development. NuPrl (Cornell - USA). Based on the Computational Type Theory. Tactic-based. Written in ML. 41/46

42 Further Reading Agda as a dependently typed proof assistant: Bove, A. and Dybjer, P. [2009]. Dependent Types at Work. In: Ler- Net ALFA Summer School Ed. by Bove, A., Soares Barbosa, L., Pardo, A. and Sousa Pinto, J. Vol Lecture Notes in Computer Science. Springer, pp doi: / _2. Agda as a dependently typed functional programming language: Norell, U. [2009]. Dependently Typed Programming in Agda. In: Advanced Functional Programming (AFP 2008). Ed. by Koopman, P., Plasmeijer, R. and Swierstra, D. Vol Lecture Notes in Computer Science. Springer, pp doi: / _5. 42/46

43 References Bove, A. and Dybjer, P. (2009). Dependent Types at Work. In: LerNet ALFA Summer School Ed. by Bove, A., Soares Barbosa, L., Pardo, A. and Sousa Pinto, J. Vol Lecture Notes in Computer Science. Springer, pp doi: / _2 (cit. on p. 42). Constable, R. L. (2010). The Triumph of Types: Principia Mathematica s Impact on Computer Science. Presented at the Principia Mathematica anniversary symposium (cit. on pp ). Hoare, C. A. R. (1972). Notes on Data Structuring. In: Structured Programming. Ed. by Dahl, O.-J., Disjkstra, E. W. and Hoare, C. A. R. Academic Press Inc., pp (cit. on pp. 16, 17). Kiselyov, O. and Shan, C. (2008). Interpreting Types as Abstract Values. Formosan Summer School on Logic, Language and Computacion (FLOLAC 2008) (cit. on pp ). Martin-Löf, P. (1984). Intuitionistic Type Theory. Bibliopolis (cit. on p. 23). 43/46

44 References Norell, U. (2009). Dependently Typed Programming in Agda. In: Advanced Functional Programming (AFP 2008). Ed. by Koopman, P., Plasmeijer, R. and Swierstra, D. Vol Lecture Notes in Computer Science. Springer, pp doi: / _5 (cit. on p. 42). Petricek, T. (2015). Against a Universal Definition of Type. In: Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward! 2015). ACM, pp doi: / (cit. on pp ). Pierce, B. C. (2002). Types and Programming Languages. MIT Press (cit. on pp ). Russell, B. (1908). Mathematical Logic as based on the Theory of Types. In: American Journal of Mathematics 30.3, pp doi: / (cit. on pp ). Sørensen, M.-H. and Urzyczyn, P. (2006). Lectures on the Curry-Howard Isomorphism. Vol Studies in Logic and the Foundations of Mathematics. Elsevier (cit. on p. 29). 44/46

45 References Troelstra, A. S. and van Dalen, D. (1988). Constructivism in Mathematics. An Introduction. Vol. I. North-Holland (cit. on p. 3). Wadler, P. (2015). Propositions as Types. In: Communications of the ACM 58.12, pp (cit. on pp ). 45/46

46 Demo