Normalization by Evaluation

Transcription

1 Normalization by Evaluation Andreas Abel Department of Computer Science and Engineering Chalmers and Gothenburg University PhD Seminar in Mathematical Engineering EAFIT University, Medellin, Colombia 9 March 2017 Andreas Abel (GU) NbE EAFIT / 32

2 Introduction Context of This Work Dependently-typed (programming) languages allow to express functional specifications in types, to prove (correctness) properties in the language, formalize and prove mathematical propositions. Prominent proof assistent: Coq (INRIA 1984 ) CompCert: Certifed compiler for C (Leroy) Formalized proof of Four Color Theorem (Gonthier, 2005) Odd-Order Theorem (Gonthier, 2012) Theorem Feit_Thompson (gt : fingrouptype) (G : {group gt}) : odd # G -> solvable G. Experimental languages: Agda, Idris,... Andreas Abel (GU) NbE EAFIT / 32

3 Introduction Behind the Veil What made Coq ready for huge developments? Benjamin Grégoire, Xavier Leroy: A compiled implementation of strong reduction. ICFP 2002 Efficient normalization! Grégoire, Leroy: Efficient checking of β-equality. This talk: Framework for βη-equality. Andreas Abel (GU) NbE EAFIT / 32

4 Introduction A Taste of Programming with Dependent Types Descending lists: [x, y,..., z] List n iff n x y z Constructor carries proof p for descent. nil : List 0 x : N p : x y xs : List y cons x p xs : List x Singleton list carries a trivial proof. singleton : (x : N) List x singleton x = cons x nil where : x 0 Andreas Abel (GU) NbE EAFIT / 32

5 Introduction Correct Insert Case: Insert into empty list. insert : (x : N) List n List (max x n) insert x nil = singleton x Inferred type singleton x : List x. Expected type singleton x : List (max x 0). Type-checker needs to ensure List x = List (max x 0). Sufficient: x = max x 0. Compare expressions with free variables! Solution: normalize max x 0 to x. Andreas Abel (GU) NbE EAFIT / 32

6 Introduction Normalization Bring an expression with unkowns into a canonical form. Unknowns = free variables. Checking equality by comparing canonical forms. Examples: Expression arithmetical expression functional programming language stack maching code SQL query Normalizer symbolic evaluator (MathLAB) term rewriting, partial evaluation JIT compiler query compiler Andreas Abel (GU) NbE EAFIT / 32

7 Introduction Evaluation Compute the value of an expression relative to an environment. Environment assigns values to free variables of expressions. Examples: Expression Environment Evaluator arithmetical expression valuation calculator functional programming language stack & heap interpreter stack machine code stack stack machine SQL-query database SQL processor Andreas Abel (GU) NbE EAFIT / 32

8 Introduction Normalization by Evaluation (NbE) Adapt an interpreter to simplify expressions with unknowns. MLTT Martin-Löf 1975: NbE for Type Theory (weak conversion) STL Berger Schwichtenberg 1991: NbE for simply-typed λ-calculus T Danvy 1996: Type-directed partial evaluation F Altenkirch Hofmann Streicher 1996: NbE for λ-free System F λ Aehlig Joachimski 2004: Untyped NbE, operationally λ Filinski Rohde 2004: Untyped NbE, denotationally LF Danielsson 2006: strongly typed NbE for LF T Altenkirch Chapman 2007: Tait in one big step Andreas Abel (GU) NbE EAFIT / 32

9 Monoids Monoids Monoid (M,, ε): set M with a binary operation that has a unit ε. a (b c) = (a b) c associativity ε a = a left unit a ε = a right unit E.g.: (N, +, 0), (N,, 1), (Bool,, true), (Bool,, false), (R n n,, I n ). Free monoid: Sequences with concatenation (List A, ++, [ ]). [a 1,..., a m ] ++ [a m+1,..., a n ] = [a 1,..., a n ] Andreas Abel (GU) NbE EAFIT / 32

10 Monoids Monoid Expressions Fix a carrier A and a set of variables X. Terms (abstract syntax trees) representing monoid elements: Exp t ::= a singleton a A x variable x X ε empty sequence t 1 t 2 concatenation, right associative Example in concrete syntax: ex := (x 0 1) (((2 (ε x 1 )) (ε 4)) x 2 ) Andreas Abel (GU) NbE EAFIT / 32

11 Monoids Interpreting Monoid Expressions Monoid values Val = List A. Environment ρ X Val. Interpretation t ρ Val. x ρ = ρ(x) ε ρ = [ ] empty list a ρ = [a] singleton list t 1 t 2 ρ = t 1 ρ ++ t 2 ρ append Example. Recall ex = (x 0 1) (((2 (ε x 1 )) (ε 4)) x 2 ) ex (x0 =0,x 1 =3,x 2 =5) = [0, 1, 2, 3, 4, 5] Andreas Abel (GU) NbE EAFIT / 32

12 Monoids Normalizing Monoid Expressions I Val = List (A X ). Reflection of variables into values. : X Val x = [x] Reification of values as expressions. : Val Exp [] = ε (a :: v) = a v (x :: v) = x v Andreas Abel (GU) NbE EAFIT / 32

13 Monoids Normalizing Monoid Expressions II Normalization: nf : Exp Exp nf(t) = t Example. Recall ex = (x 0 1) (((2 (ε x 1 )) (ε 4)) x 2 ) nf(ex) = x x 1 4 x 2 ε Andreas Abel (GU) NbE EAFIT / 32

14 Untyped Lambda Calculus Untyped Lambda Calculus, Informally Calculus of functions. Everything is a function. Examples: id = λx. x identity function app = λf. λx. f x application function (also identity) twice = λf. λx. f (f x) apply f twice comp = λf. λg. λx. f (g x) compose two functions Calculation: app twice id = twice id = λx. id (id x) = λx. id x = λx. x = id. Andreas Abel (GU) NbE EAFIT / 32

15 Untyped Lambda Calculus Numbers in the Untyped Lambda Calculus Numbers n N are represented by Church numerals n. 0 = λf. λx. x 1 = λf. λx. f x 2 = λf. λx. f (f x) n = λf. λx. f n x Addition is a sort of composition. plus = λn m f x. n f (m f x) plus n m = λf x. n f (m f x) = λf x. f n (f m x) = λf x. f n+m x = n + m Andreas Abel (GU) NbE EAFIT / 32

16 Untyped Lambda Calculus Recursion in the Untyped Lambda Calculus Reduction: (λx. t) s t[s/x] A looping term: (λx. x x) (λx. x x) (x x)[(λx. x x)/x] = (λx. x x) (λx. x x) Alan Turing s fixed-point combinator. Let θ = (λx. λf. f (x x f )). θ θ f f (θ θ f ) Andreas Abel (GU) NbE EAFIT / 32

17 Untyped Lambda Calculus Untyped Lambda Calculus, Formally Grammar: Exp r, s, t ::= x variable λx. t abstracting variable x in body t r s applying r to s Equational theory (β): (λx. t) s = t[s/x] β-normal forms. Nf v ::= λx. v u normal form Ne u ::= x u v neutral term Andreas Abel (GU) NbE EAFIT / 32

18 Untyped Lambda Calculus Evaluation of Lambda-Expressions Values a, b, f D with (partial) application : D D D. Evaluation (specification): x ρ = ρ(x) r s ρ. = r ρ s ρ λx. t ρ a. = t (ρ,a/x) Instance: compiled execution. f a λx. t ρ Call f with argument a Code for function λx. t with predefined variables ρ Andreas Abel (GU) NbE EAFIT / 32

19 Untyped Lambda Calculus Implementation via Closures Instance: do nothing. λx. t ρ = (λxt)ρ Initial applicative structure: closures. D a, b, f ::= (λxt)ρ waiting for value of x Application and evaluation are mutually defined. (λxt)ρ a = t (ρ,a/x) r s ρ = r ρ s ρ Andreas Abel (GU) NbE EAFIT / 32

20 Untyped Lambda Calculus Residual Model: Adding Unknowns For normalization, we need free variables in D. Application x a of a free variable stores argument a. Need neutrals/accumulators x a in D. D a, b, f ::= (λxt)ρ e D ne e ::= x e a Application extended: (λxt)ρ a = t (ρ,a/x) x a a = x ( a, a) Andreas Abel (GU) NbE EAFIT / 32

21 Untyped Lambda Calculus Reading Back Expressions from Values Reading back values: R nf : D Nf R nf ((λxt)ρ) = λy. R nf ( t (ρ,y/x) ) where y fresh R nf (e) = R ne (e) Reading back neutrals: R ne : D ne Ne R ne (x) = x R ne (e a) = R ne (e) R nf (a) Andreas Abel (GU) NbE EAFIT / 32

22 Untyped Lambda Calculus Fresh Name Generation Freshness problem: 9 approaches. Simple solution: R nf ξ reads fresh names from supply ξ. E.g., ξ is an infinite stream of distinct identifiers. R nf (y,ξ)((λxt)ρ) = λy. Rnf ξ ( t (ρ,y/x)) R nf ξ (e) = R ne ξ (e) R ne ξ (x a) = x R nf ξ ( a) Normalization: nf ξ (t) = R nf ξ ( t ρ id ) Andreas Abel (GU) NbE EAFIT / 32

23 Untyped Lambda Calculus Summary: NbE for Untyped Lambda-Calculus Semantics D [ ] R nf D ne Syntax Exp Nf R ne Ne Var Andreas Abel (GU) NbE EAFIT / 32

24 Typed Lambda Calculus Simply-Typed Lambda Calculus Types S, T ::= N S T. Typing contexts Γ ::= x 1 :S 1,..., x n :S n. Typing Γ t : T. (x :T ) Γ Γ x : T Equational theory (βη). Γ, x :S t : T Γ λx. t : S T Γ r : S T Γ s : S Γ r s : T (β) Γ, x :S t : T Γ s : S Γ (λxt) s = t[s/x] : T (η) Γ t : S T Γ t = λx. t x : S T Andreas Abel (GU) NbE EAFIT / 32

25 Typed Lambda Calculus Bidirectional η-expansion T reflection : η-expansion inside-out T reification : η-expansion outside-in Example (terms): (N N) (N N) f = λy. N N (f ( N N y)) = λy. λx. N (f ( N N y) ( N x)) = λy. λx. N (f (λz. N (y ( N z))) ( N x)) = λy. λx. f (λz. y z) x Andreas Abel (GU) NbE EAFIT / 32

26 Typed Lambda Calculus Adding η-expansion Semantics (β) D T T Semantics (βη) [ ] D nf D ne R nf R ne Syntax Exp Nf Ne Var Andreas Abel (GU) NbE EAFIT / 32

27 Typed Lambda Calculus Eta-expansion: reflection and reification Values now include delayed η-expansions. D a, b, f ::= (λxt)ρ T e D ne e ::= x e d D nf d ::= T a Application and readback trigger these expansions. (λxt)ρ a = t (ρ,a/x) S T e a = T (e S a) R nf (y,ξ) ( S T f ) = λy. R nf ξ ( T (f S y)) R nf ξ ( N N e) = R ne ξ (e) Andreas Abel (GU) NbE EAFIT / 32

28 Typed Lambda Calculus Normalization for STL Canonical environment: ρ Γ (x) = T x where (x : T ) Γ Variable supply: ξ Γ = Var \ Γ Normalization of Γ t : T : nf T Γ (t) = Rnf ξ Γ ( T t ργ ) Andreas Abel (GU) NbE EAFIT / 32

29 Typed Lambda Calculus Correctness of Normalization Normalization is sound if for all expressions Γ t : T, Γ t = nf T Γ (t) : T. Normalization is complete if for all Γ t, t : T, Γ t = t : T = nf T Γ (t) = α nf T Γ (t ) Implies idempotence nf T Γ (t) = α nf T Γ (nft Γ (t)). Andreas Abel (GU) NbE EAFIT / 32

30 Typed Lambda Calculus Completeness of Normalization Well-typed βη-equal terms have the same normal form. Γ t = t : T = a {}}{ t ργ = a {}}{ t ργ A {}}{ T ργ = a = a A = A a = A a = R nf ξ Γ A a = α R nf ξ Γ A a Andreas Abel (GU) NbE EAFIT / 32

31 Typed Lambda Calculus Soundness of Normalization A well-typed term is βη-equal to its normal form. Γ t : T = Γ t : T R = Γ t = R nf ξ Γ A a : T a A {}}{{}}{ t ργ T ργ Γ t = nf T Γ (t) : T Andreas Abel (GU) NbE EAFIT / 32

32 Conclusions Conclusions Interpreters can be turned into normalizers in a systematic way. Normalization-by-evaluation has helped to understand η-equality. NbE is also a theoretical tool to investigate Type Theory. E.g., to prove decidability of type checking. Andreas Abel (GU) NbE EAFIT / 32