Geometry of Interaction

Slides:



Advertisements
Similar presentations
Automated Theorem Proving Lecture 1. Program verification is undecidable! Given program P and specification S, does P satisfy S?
Advertisements

The Expressivity of Quantifying over Regions Ernest Davis March 20, 2007.
X-and Y-intercepts. Standard Form (of a linear equation) ax + by = c, where a, b, and c are integers.
Automated Verification with HIP and SLEEK Asankhaya Sharma.
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Solve Linear Systems by Substitution
A Modal Language for the Safety of Mobile Values (work in progress) SNU 4/7/2006 박성우 Sungwoo Park POSTECH.
Translations Translations and Getting Ready for Reflections by Graphing Horizontal and Vertical Lines.
CSE 230 The -Calculus. Background Developed in 1930’s by Alonzo Church Studied in logic and computer science Test bed for procedural and functional PLs.
Semantics In Text: Chapter 3.
12/2/20151 GC16/3011 Functional Programming Lecture 2 The Lambda Calculus: A Simple Introduction.
Graphing a Linear Inequality
October 3, 2001CSE 373, Autumn Mathematical Background Exponents X A X B = X A+B X A / X B = X A-B (X A ) B = X AB X N +X N = 2X N 2 N +2 N = 2 N+1.
Use the substitution method
3.3 ll Lines & Transversals p Definitions Parallel lines (ll) – lines that are coplanar & do not intersect. (Have the some slope. ) l ll m Skew.
2/6/20161 Programming Languages and Compilers (CS 421) Elsa L Gunter 2112 SC, UIUC Based in part on slides by Mattox.
Solve Linear Systems by Substitution Students will solve systems of linear equations by substitution. Students will do assigned homework. Students will.
Cut Elimination – Splitting versus Proof Nets Antrittsvortrag zur Diplomarbeit von Matthias Horbach Betreuer: Lutz Straßburger.
1 Interactive Computer Theorem Proving CS294-9 October 19, 2006 Adam Chlipala UC Berkeley Lecture 9: Beyond Primitive Recursion.
Geometry of Interaction Models proofs of linear logic as bidirectional computation executed by the flow of data in the proof net.
Spring 2017 Program Analysis and Verification
Chapter 2: Lambda Calculus
Tutorial on PROOF NETS Claudia Faggian.
CS 550 Programming Languages Jeremy Johnson
CSE-321 Programming Languages Simply Typed -Calculus
CSE15 Discrete Mathematics 03/22/17
Richard Anderson Lecture 26 NP-Completeness
10.3 Solving Linear Systems
Solving Systems of Three Linear Equations in Three Variables
EVALUATING LIMITS ANALYTICALLY (1.3)
Richard Anderson Lecture 26 NP-Completeness
September 4, 1997 Programming Languages (CS 550) Lecture 6 Summary Operational Semantics of Scheme using Substitution Jeremy R. Johnson TexPoint fonts.
Discrete Math (2) Haiming Chen Associate Professor, PhD
Lesson 4 Typed Arithmetic Typed Lambda Calculus
D I s , a ·.... l8l8.
Proving Properties of Recursive List Functions
Unit 2: Functions.
Test questions will be at the end of class…
Typed Arithmetic Expressions
Lesson2 Lambda Calculus Basics
CSE 311 Foundations of Computing I
5-6 Derivatives of Inverse Trig Functions
Carlos Varela Rennselaer Polytechnic Institute September 4, 2015
Notes 9.5 – Mathematical Induction
Unit 2: Functions.
What is the x-intercept?
Let {image} Use substitution to determine which elements of S satisfy the inequality {image} Select the correct answer(s): {image}
Semantics In Text: Chapter 3.
Amazing fact #3: -calculus is Turing-complete!
I ll I
Warm Up 8/17/17 Find the equation of the line with
DISCRETE COMPUTATIONAL STRUCTURES
Unit 2: Functions.
Evaluate the limit: {image} Choose the correct answer from the following:
Bellwork “quick check” pg. 448 (1-11)
' 1 A ./.\.l+./.\.l
This Lecture Substitution model
Proofs are Programs: 19th Century Logic and 21st Century Computing
CSE S. Tanimoto Lambda Calculus
Choose the correct translation from pre-image to image B
5-3 Standard Form Hubarth Algebra.
Program correctness Axiomatic semantics
Warm Up Check to see if the point is a solution for the
Chapter 5 Section 4 Factoring Trinomials.
CIS 720 Lecture 3.
Programming Languages and Compilers (CS 421)
CIS 720 Lecture 3.
Dr J Frost GCSE :: Term-to-term Sequences and Arithmetic vs Geometric Progressions Dr J Frost
Amazing fact #3: -calculus is Turing-complete!
Graphing Linear Equations
Presentation transcript:

Geometry of Interaction

This is the paper!

Program of Geometry of Interaction

Goal - the model of GoI will be: Thm: it is a model, i.e. is invariant under normalization

System F translates into LL2 (2nd order Linear Logic) F is an extension of lambda calc. with 2nd order LJ <---> lamba calculus (Curry Howard) LJ translates in LL F translates into LL2

Linear Logic

Intuitionistic logic into LL, and system F into LL2 The translation of Intuitionistic logic into LL, and system F into LL2 is given in Girard's original paper

PN2 is LL2 presented as proof nets

PN2 is LL2 presented as proof nets

Integers in LL2

n+1 axiom-links represents the Int n

successor

How to use successor

Primitive recursion

Booleans (coding with additives) but we will rather use the coding in MLL2 (because additives do not work so well in GoI)

We first focus on MLL2

MLL2 MLL + 2nd order QUANTIFIERS

Revision of MLL proof nets

Proof structures

Proof Nets

Correctness guarantees: Graph is image of a proof Normalization terminates

Normalization (local graph reductions)

Properties of normalization

MLL2 proof nets: MLL + quantifiers

X is substituted by B everywhere inside the box Reduction X is substituted by B everywhere inside the box

Let us try out!