This document discusses identity types in type theory and propositional equality. It covers:
1. Identity types were introduced in Martin-Lof's intuitionistic type theory as a way to formalize proofs of equality statements.
2. Recent work has explored connections between identity types and homotopy theory, interpreting types as topological spaces and identity types as paths between points.
3. Proofs of equality can be seen as computational paths between terms. The functional interpretation views proofs as functions between terms.
Propositional Equality, Identity Types and HomotopiesRuy De Queiroz
Palestra, em 05/02/2015, no Workshop de Matemática Aplicada, parte do VII Workshop de Verão em Matemática da Universidade de Brasília (UnB) realizado entre os dias 2 e 13 de fevereiro de 2015.
Dialectica Categories Surprising Application: mapping cardinal invariantsValeria de Paiva
Talk at 2nd Set Theory and General Topology Week in Salvador, Bahia, Brazil, March 2012
Abstract: Goethe famously said that "Mathematicians are like Frenchmen:
whatever you say to them they translate into their own language and forthwith it is something entirely different." True. Even more true of category theorists. Following this great tradition of appropriating other people's work, I want to tell you how I learned about "cardinalities of the continuum" from Blass and Morgan and da Silva
and how I want to rock their boat, just a little, in the direction of my kind of mathematics.
Propositional Equality, Identity Types and HomotopiesRuy De Queiroz
Palestra, em 05/02/2015, no Workshop de Matemática Aplicada, parte do VII Workshop de Verão em Matemática da Universidade de Brasília (UnB) realizado entre os dias 2 e 13 de fevereiro de 2015.
Dialectica Categories Surprising Application: mapping cardinal invariantsValeria de Paiva
Talk at 2nd Set Theory and General Topology Week in Salvador, Bahia, Brazil, March 2012
Abstract: Goethe famously said that "Mathematicians are like Frenchmen:
whatever you say to them they translate into their own language and forthwith it is something entirely different." True. Even more true of category theorists. Following this great tradition of appropriating other people's work, I want to tell you how I learned about "cardinalities of the continuum" from Blass and Morgan and da Silva
and how I want to rock their boat, just a little, in the direction of my kind of mathematics.
Lecture 2: From Semantics To Semantic-Oriented ApplicationsMarina Santini
From the "Natural Language Processing" LinkedIn group:
John Kontos, Professor of Artificial Intelligence
I wonder whether translating into formal logic is nothing more than transliteration which simply isolates the part of the text that can be reasoned upon using the simple inference mechanism of formal logic. The real problem I think lies with the part of text that CANNOT be translated one the one hand and the one that changes its meaning due to civilization advances. My own proposal is to leave NL text alone and try building inference mechanisms for the UNTRANSLATED text depending on the task requirements.
All the best
John"
Lecture 2: From Semantics To Semantic-Oriented ApplicationsMarina Santini
From the "Natural Language Processing" LinkedIn group:
John Kontos, Professor of Artificial Intelligence
I wonder whether translating into formal logic is nothing more than transliteration which simply isolates the part of the text that can be reasoned upon using the simple inference mechanism of formal logic. The real problem I think lies with the part of text that CANNOT be translated one the one hand and the one that changes its meaning due to civilization advances. My own proposal is to leave NL text alone and try building inference mechanisms for the UNTRANSLATED text depending on the task requirements.
All the best
John"
Computational Paths and the Calculation of Fundamental GroupsRuy De Queiroz
Apresentação online na Série "Lógicos em Quarentena", iniciativa conjunta da Soc. Brasileira de Lógica e do Grupo de Interesse em Lógica da Soc. Brasileira de Computação, 20/05/2020
Connections between Logic and Geometry via Term RewritingRuy De Queiroz
Invited talk at the 11th International Conference on Logic and Applications - LAP 2022, held as a hybrid meeting hosted by the Inter University Center Dubrovnik, Croatia, September 26 - 29, 2022.
Contribuição ao painel sobre os aspectos jurídicos, tecnológicos e compliance, "A Nova Lei Geral de Proteção de Dados", com Amália Câmara, Marcílio Braz Jr, e Carlos Sampaio, Auditório da FCAP-UPE, 15/03/2019
Apresentação realizada no Sexto Prospecta | Recife:
a pesquisa científica com foco na responsabilidade social, evento organizado pelo Instituto Futuro / UFPE, em 26/10/2017
Linguagem, lógica e a natureza da matemáticaRuy De Queiroz
"Linguagem, Lógica e a Natureza da Matemática", palestra ministrada no IV Congresso da Associação de Linguagem & Direito - Linguagem & Direito: rios sem discurso?", de 28 a 30/09/2016, na UNICAP, em Recife.
Apresentado no VIII Congresso de Direito da Informática e Telecomunicações (TELECON), realizado no Auditório do Fórum Des. Rodolfo Aureliano, Recife, 22/09/2016
20 Comprehensive Checklist of Designing and Developing a WebsitePixlogix Infotech
Dive into the world of Website Designing and Developing with Pixlogix! Looking to create a stunning online presence? Look no further! Our comprehensive checklist covers everything you need to know to craft a website that stands out. From user-friendly design to seamless functionality, we've got you covered. Don't miss out on this invaluable resource! Check out our checklist now at Pixlogix and start your journey towards a captivating online presence today.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
Building RAG with self-deployed Milvus vector database and Snowpark Container...Zilliz
This talk will give hands-on advice on building RAG applications with an open-source Milvus database deployed as a docker container. We will also introduce the integration of Milvus with Snowpark Container Services.
UiPath Test Automation using UiPath Test Suite series, part 5DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 5. In this session, we will cover CI/CD with devops.
Topics covered:
CI/CD with in UiPath
End-to-end overview of CI/CD pipeline with Azure devops
Speaker:
Lyndsey Byblow, Test Suite Sales Engineer @ UiPath, Inc.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Propositional Equality and Identity Types
1. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Propositional Equality and Identity Types
Ruy de Queiroz
(joint work with Anjolina de Oliveira)
Univ. Federal de Pernambuco, Recife, Brazil
Seminar at Logic Group, TU Darmstadt
19 Aug 2013
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
2. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Content
1 Identity Types in Type Theory
2 Heyting’s explanation via proofs
3 Direct Computations
4 The Functional Interpretation of Propositional Equality
5 Normal form for equality proofs
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
3. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
What is a proof of an equality statement?
What is the formal counterpart of a proof of an equality?
In talking about proofs of an equality statement, two dichotomies
arise:
1 definitional equality versus propositional equality
2 intensional equality versus extensional equality
First step on the formalisation of proofs of equality statements: Per
Martin-L¨of’s Intuitionistic Type Theory (Log Coll ’73, published 1975)
with the so-called Identity Type
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
4. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types
Identity Types - Topological and Categorical Structure
Workshop, Uppsala, November 13–14, 2006
“The identity type, the type of proof objects for the
fundamental propositional equality, is one of the most
intriguing constructions of intensional dependent type
theory (also known as Martin-L¨of type theory). Its
complexity became apparent with the Hofmann–Streicher
groupoid model of type theory. This model also hinted at
some possible connections between type theory and
homotopy theory and higher categories. Exploration of this
connection is intended to be the main theme of the
workshop.”
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
5. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types
Type Theory and Homotopy Theory
Indeed, a whole new research avenue has since 2005 been explored
by people like Vladimir Voevodsky and Steve Awodey in trying to
make a bridge between type theory and homotopy theory, mainly via
the groupoid structure exposed in the Hofmann–Streicher (1994)
countermodel to the principle of Uniqueness of Identity Proofs (UIP).
This has open the way to, in Awodey’s words,
“a new and surprising connection between Geometry,
Algebra, and Logic, which has recently come to light in the
form of an interpretation of the constructive type theory of
Per Martin-L¨of into homotopy theory, resulting in new
examples of certain algebraic structures which are
important in topology”. (“Type Theory and Homotopy”,
preprint, 2010.)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
6. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types
Identity Types as Topological Spaces
According to B. van den Berg and R. Garner (“Topological and
simplicial models of identity types”, ACM Transactions on
Computational Logic, Jan 2012),
“All of this work can be seen as an elaboration of the
following basic idea: that in Martin-L¨of type theory, a type A
is analogous to a topological space; elements a, b ∈ A to
points of that space; and elements of an identity type
p, q ∈ IdA(a, b) to paths or homotopies p, q : a → b in A.”.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
7. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types
Identity Types as Topological Spaces
From the Homotopy type theory collective book
(2013):
“In type theory, for every type A there is a (formerly
somewhat mysterious) type IdA of identifications of two
objects of A; in homotopy type theory, this is just the path
space AI
of all continuous maps I → A from the unit
interval. In this way, a term p : IdA(a, b) represents a path
p : a b in A.”
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
8. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types: Iteration
From Propositional to Predicate Logic and Beyond
In the same aforementioned workshop, B. van den Berg in his
contribution “Types as weak omega-categories” draws attention to the
power of the identity type in the iterating types to form a globular set:
“Fix a type X in a context Γ. Define a globular set as follows:
A0 consists of the terms of type X in context Γ,modulo
definitional equality; A1 consists of terms of the types
Id(X; p; q) (in context Γ) for elements p, q in A0, modulo
definitional equality; A2 consists of terms of well-formed
types Id(Id(X; p; q); r; s) (in context Γ) for elements p, q in
A0, r, s in A1, modulo definitional equality; etcetera...”
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
9. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Identity Types: Iteration
The homotopy interpretation
Here is how we can see the connections between proofs of equality
and homotopies:
a, b : A
p, q : IdA(a, b)
α, β : IdIdA(a,b)(p, q)
· · · : IdIdId...
(· · · )
Now, consider the following
interpretation:
Types Spaces
Terms Maps
a : A Points a : 1 → A
p : IdA(a, b) Paths p : a ⇒ b
α : IdIdA(a,b)(p, q) Homotopies α : p q
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
10. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Propositional Equality
Proofs of equality as (rewriting) computational paths
Motivated by looking at equalities in type theory as arising from the
existence of computational paths between two formal objects, our
purpose here is to offer a different perspective on the role and the
power of the notion of propositional equality as formalised in the
so-called Curry–Howard functional interpretation. The main idea
goes back to a paper entitled “Equality in labelled deductive systems
and the functional interpretation of propositional equality”, , presented
in Dec 1993 at the 9th Amsterdam Colloquium, and published in the
proceedings in 1994.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
11. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Brouwer–Heyting–Kolmogorov Interpretation
Proofs rather than truth-values
a proof of the proposition: is given by:
A ∧ B a proof of A and
a proof of B
A ∨ B a proof of A or
a proof of B
A → B a function that turns a proof of A
into a proof of B
∀xD
.P(x) a function that turns an element a
into a proof of P(a)
∃xD
.P(x) an element a (witness)
and a proof of P(a)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
12. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Brouwer–Heyting–Kolmogorov Interpretation: Formally
Canonical proofs rather than truth-values
a proof of the proposition: has the canonical form of:
A ∧ B p, q where p is a proof of A and
q is a proof of B
A ∨ B inl(p) where p is a proof of A or
inr(q) where q is a proof of B
(‘inl’ and ‘inr’ abbreviate
‘into the left/right disjunct’)
A → B λx.b(x) where b(p) is a proof of B
provided p is a proof of A
∀xD
.P(x) Λx.f(x) where f(a) is a proof of P(a)
provided a is an arbitrary individual chosen
from the domain D
∃xD
.P(x) εx.(f(x), a) where a is a witness
from the domain D, f(a) is a proof of P(a)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
13. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Brouwer–Heyting–Kolmogorov Interpretation
What is a proof of an equality statement?
a proof of the proposition: is given by:
t1 = t2 ?
(Perhaps a sequence of rewrites
starting from t1 and ending in t2?)
What is the logical status of the symbol “=”?
What would be a canonical/direct proof of t1 = t2?
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
14. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Statman’s Direct Computations
Terms, Equations, Measure
Definition (equations and systems of equations)
Let us consider equations E between individual terms
a, b, c, . . ., possibly containing function variables, and finite sets
of equations S.
Definition (measure)
A function M from terms to non-negative integers is called a
measure if M(a) ≤ M(b) implies M(c[a/x]) ≤ M(c[b/x]), and,
whenever x occurs in c, M(a) ≤ M(c[a/x]).
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
15. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Statman’s Direct Computations
Kreisel–Tait’s calculus K
Definition (calculus K)
The calculus K of Kreisel and Tait consists of the axioms a = a and
the rule of substituting equals for equals:
(1)
E[a/x] a
.
= b
E[b/x]
where a
.
= b is, ambiguously, a = b and b = a, together with the rules
(2)
sa = sb
a = b
(3)
0 = sa
b = c
(4)
a = sn
a
b = c
H will be the system consisting only of the rule (1)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
16. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
Statman’s Direct Computations
Computations, Direct Computations
Definition (computation)
Computations T in K or H are binary trees of equation
occurrences built up from assumptions and axioms according
to the rules.
Definition (direct computation)
If M is a measure, we say that a computation T of E from S is
M-direct if for each term b occurring in T there is a term c
occurring in E or S with M(b) ≤ M(c).
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
17. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Propositional Equality
Curry–Howard and Labelled Deduction
Our aims:
Using Gentzen’s methods for equality reasoning
(Statman’77)
Addressing the dichotomy: definitional vs. propositional
Giving an alternative to the ‘Equality/Identity Type’ of
Martin-L¨of’s Type Theory
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
18. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Equality
Sequences of conversions
(λx.(λy.yx)(λw.zw))v η (λx.(λy.yx)z)v β (λy.yv)z β zv
(λx.(λy.yx)(λw.zw))v β (λx.(λw.zw)x)v η (λx.zx)v β zv
(λx.(λy.yx)(λw.zw))v β (λx.(λw.zw)x)v β (λw.zw)v η zv
There is at least one sequence of conversions from the initial term to
the final term. (In this case we have given three!) Thus, in the formal
theory of λ-calculus, the term (λx.(λy.yx)(λw.zw))v is declared to be
equal to zv.
Now, some natural questions arise:
1 Are the sequences themselves normal?
2 Are there non-normal sequences?
3 If yes, how are the latter to be identified and (possibly)
normalised?
4 What happens if general rules of equality are involved?Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
19. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Equality
Propositional equality
Definition (Hindley & Seldin 2008)
P is β-equal or β-convertible to Q (notation P =β Q) iff Q is
obtained from P by a finite (perhaps empty) series of
β-contractions and reversed β-contractions and changes of
bound variables. That is, P =β Q iff there exist P0, . . . , Pn
(n ≥ 0) such that
P0 ≡ P, Pn ≡ Q,
(∀i ≤ n − 1)(Pi 1β Pi+1 or Pi+1 1β Pi or Pi ≡α Pi+1).
NB: equality with an existential force.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
20. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Equality
Gentzen’s ND for propositional equality
Remark
In setting up a set of Gentzen’s ND-style rules for equality we
need to account for:
1 definitional versus propositional equality;
2 there may be more than one normal proof of a certain
equality statement;
3 given a (possibly non-normal) proof, the process of
bringing it to a normal form should be finite and confluent.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
21. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computation
Equality in Type Theory
Martin-L¨of’s Intuitionistic Type Theory:
Intensional (1975)
Extensional (1982(?), 1984)
Remark (Definitional vs. Propositional Equality)
definitional, i.e. those equalities that are given as rewrite
rules, orelse originate from general functional principles
(e.g. β, η, ξ, µ, ν, etc.);
propositional, i.e. the equalities that are supported (or
otherwise) by an evidence (a sequence of substitutions
and/or rewrites)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
22. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computation
Definitional Equality
Definition (Hindley & Seldin 2008)
(α) λx.M = λy.[y/x]M (y /∈ FV(M))
(β) (λx.M)N = [N/x]M
(η) (λx.Mx) = M (x /∈ FV(M))
(ξ)
M = M
λx.M = λx.M
(µ)
M = M
NM = NM
(ν)
M = M
MN = M N
(ρ) M = M
(σ)
M = N
N = M
(τ)
M = N N = P
M = P
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
23. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computation
Intuitionistic Type Theory
→-introduction
[x : A]
f(x) = g(x) : B
λx.f(x) = λx.g(x) : A → B
(ξ)
→-elimination
x = y : A g : A → B
gx = gy : B
(µ)
x : A g = h : A → B
gx = hx : B
(ν)
→-reduction
a : A
[x : A]
b(x) : B
(λx.b(x))a = b(a/x) : B
(β)
c : A → B
λx.cx = c : A → B
(η)
Role of ξ: Bishop’s constructive principles.
Role of η: “[In CL] All it says is that every term is equal to an
abstraction” [Hindley & Seldin, 1986]
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
24. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Lessons from Curry–Howard and Type Theory
Harmonious combination of logic and λ-calculus;
Proof terms as ‘record of deduction steps’,
Function symbols as first class citizens.
Cp.
∃xP(x)
[P(t)]
C
C
with
∃xP(x)
[t : D, f(t) : P(t)]
g(f, t) : C
? : C
in the term ‘?’ the variable f gets abstracted from, and this enforces a
kind of generality to f, even if this is not brought to the ‘logical’ level.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
25. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Labelled Deduction
to find a unifying framework factoring out meta- from
object- level features;
to keep the logic (and logical steps, for that matter) simple,
handling meta-level features via a separate, yet
harmonious calculus;
to make sure the relevant assumptions in a deduction are
uncovered, paying more attention to the explicitation and
use of resources.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
26. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Equality in Intensional Type Theory
A type a : A b : A
Idint
A (a, b) type
Idint
-formation
a : A
r(a) : Idint
A (a, a)
Idint
-introduction
a = b : A
r(a) : Idint
A (a, b)
Idint
-introduction
a : A b : A c : Idint
A (a, b)
[x : A]
d(x) : C(x, x, r(x))
[x : A, y : A, z : Idint
A (x, y)]
C(x, y, z) type
J(c, d) : C(a, b, c)
Idint
-
a : A
[x : A]
d(x) : C(x, x, r(x))
[x : A, y : A, z : Idint
A (x, y)]
C(x, y, z) type
J(r(a), d(x)) = d(a/x) : C(a, a, r(a))
Idint
-equality
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
27. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Equality in Extensional Type Theory
A type a : A b : A
Idext
A (a, b) type
Idext
-formation
a = b : A
r : Idext
A (a, b)
Idext
-introduction
c : Idext
A (a, b)
a = b : A
Idext
-elimination
c : Idext
A (a, b)
c = r : Idext
A (a, b)
Idext
-elimination
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
28. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
The missing entity
Considering the lessons learned from Type Theory, the
judgement of the form:
a = b : A
which says that a and b are equal elements from domain D, let
us add a function symbol:
a =s b : A
where one is to read: a is equal to b because of ‘s’ (‘s’ being
the rewrite reason); ‘s’ is a term denoting a sequence of
equality identifiers (β, η, ξ, etc.), i.e. a composition of rewrites.
In other words, ‘s’ is the computational path from a to b.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
29. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Propositional Equality
Id-introduction
a =s b : A
s(a, b) : IdA(a, b)
Id-elimination
m : IdA(a, b)
[a =g b : A]
h(g) : C
REWR(m, ´g.h(g)) : C
Id-reduction
a =s b : A
s(a, b) : IdA(a, b)
Id-intr
[a =g b : A]
h(g) : C
REWR(s(a, b), ´g.h(g)) : C
Id-elim
β
[a =s b : A]
h(s/g) : C
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
30. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Propositional Equality: A Simple Example of a Proof
By way of example, let us prove
Πx : AΠy : A(IdA(x, y) → IdA(y, x))
[p : IdA(x, y)]
[x =t y : A]
y =σ(t) x : A
(σ(t))(y, x) : IdA(y, x)
REWR(p,´t(σ(t))(y, x)) : IdA(y, x)
λp.REWR(p,´t(σ(t))(y, x)) : IdA(x, y) → IdA(y, x)
λy.λp.REWR(p,´t(σ(t))(y, x)) : Πy : A(IdA(x, y) → IdA(y, x))
λx.λy.λp.REWR(p,´t(σ(t))(y, x)) : Πx : AΠy : A(IdA(x, y) → IdA(y, x))
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
31. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Rule of Substitution
x =g y : A f(x) : P(x)
g(x, y) · f(x) : P(y)
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
32. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Normal form for the rewrite reasons
Strategy:
Analyse possibilities of redundancy
Construct a rewriting system
Prove termination and confluence
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
33. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Normal form for the rewrite reasons
Definition (equation)
An equation in our LNDEQ is of the form:
s =r t : A
where s and t are terms, r is the identifier for the rewrite reason, and
A is the type (formula).
Definition (system of equations)
A system of equations S is a set of equations:
{s1 =r1
t1 : A1, . . . , sn =rn
tn : An}
where ri is the rewrite reason identifier for the ith equation in S.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types
34. Identity Types in Type Theory Heyting’s explanation via proofs Direct Computations The Functional Interpretation of Propositional E
The Functional Interpretation of Direct Computations
Normal form for the rewrite reasons
Definition (rewrite reason)
Given a system of equations S and an equation s =r t : A, if
S s =r t : A, i.e. there is a deduction/computation of the
equation starting from the equations in S, then the rewrite
reason r is built up from:
(i) the constants for rewrite reasons: { ρ, σ, τ, β, η, ν, ξ, µ };
(ii) the ri’s;
using the substitution operations:
(iii) subL;
(iv) subR;
and the operations for building new rewrite reasons:
(v) σ, τ, ξ, µ.
Ruy de Queiroz (joint work with Anjolina de Oliveira) Univ. Federal de Pernambuco, Recife, Brazil
Propositional Equality and Identity Types