This document provides an overview of categorical semantics for explicit substitutions. It begins by motivating explicit substitutions and categorical semantics. Indexed categories are initially discussed as a way to model explicit substitutions but are noted to have issues. Context-handling categories and E-categories are then introduced as improved ways to model explicit substitutions and type structure respectively, by adding natural transformations. L-categories are discussed as extending this approach to linear type structure. Finally, the document outlines how !L-categories can be used to model the exponential/bang type constructor by using a monoidal adjunction. In total, the document proposes categorical structures to formally capture explicit substitutions and different type structures.
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
Semantic Web technologies are a set of languages standardized by the World Wide Web Consortium (W3C) and designed to create a web of data that can be processed by machines. One of the core languages of the Semantic Web is Web Ontology Language (OWL), a family of knowledge representation languages for authoring ontologies or knowledge bases. The newest OWL is based on Description Logics (DL), a family of logics that are decidable fragments of first-order logic. leanCoR is a new description logic reasoner designed for experimenting with the new connection method algorithms and optimization techniques for DL. leanCoR is an extension of leanCoP, a compact automated theorem prover for classical first-order logic.
Dimensional analysis means analysis of the dimensions of physical quantities. Dimensional analysis lowers the number of variables in a fluid phenomenon by mixing the some variables to form parameters which have no dimensions.
Labelled Variables in Logic Programming: A First Prototipe in tuPrologRoberta Calegari
We present the first prototype of Labelled tuProlog, an extension of tuProlog exploiting labelled variables to enable a sort of multi- paradigm / multi-language programming aimed at pervasive systems.
A talk I gave at the Yonsei University, Seoul in July 21st, 2015.
The aim was to show my background contribution to the CORCON (Correctness by Construction) research project.
I have to thank Prof. Byunghan Kim and Dr Gyesik Lee for their kind hospitality.
Compositional distributional models of meaning (CDMs) aim to unify the two prominent semantic paradigms in natural language: The type-logical compositional approach of formal semantics, and the quantitative perspective of vector space models of meaning. This presentation gives an overview of state-of-the-art research on the field. We review three generic classes of CDMs: vector mixtures, tensor-based models, and deep-learning models.
Similar to Categorical Semantics for Explicit Substitutions (20)
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
3. 2/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
The Topos Institute
... we draw on rich mathematical frameworks for model-
ling relationships, including category theory, topos theory,
and type theory, as well as a long tradition of practical
construction of tools in programming languages, machine
intelligence, and ubiquitous computing.
2 / 31
7. 6/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
xSLAM: eXplicit Substitutions Linear Abstract Machine
Ritter’s PhD thesis on categorical combinators for the
Calculus of Constructions (Cambridge 1992, TCS 1994)
de Paiva’s PhD thesis on models of Linear Logic & linear
lambda-calculus (Cambridge 1990)
Put the two together for Categorical Abstract Machines for
Linear Functional Programming
Project xSLAM Explicit Substitutions for Linear Abstract
Machines (EPSRC 1997-2000)
6 / 31
8. 7/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
xSLAM: eXplicit Substitutions Linear Abstract Machine
Twenty years later:
More than 10 papers submitted to conferences
Only two in journals: Linear Explicit Substitutions. (Ghani, de
Paiva, Ritter, 2000) and Relating Categorical Semantics for
Intuitionistic Linear Logic (Maietti, Maneggia, de Paiva, Ritter
2005)
a Master’s thesis: An Abstract Machine based on Linear Logic
and Explicit Substitutions. Francisco Alberti, 1997
Two international workshops: Logical Abstract Machines
(Saarbruecken, 1998), Logical Abstract Machines
(Birmingham, 1999)
an International Dagstuhl meeting: Linear Logic and
Applications (1999)
7 / 31
9. 8/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
xSLAM Project Work
1 E. Ritter. A calculus for Resource allocation. Technical Report, University of Birmingham, 2000.
2 Maietti, de Paiva, Ritter. Linear primitive recursion. manuscript 2000.
3 Maietti, de Paiva, Ritter. Categorical Models for Intuitionistic and Linear Type Theory. FoSSaCS 2000.
4 Cervesato, de Paiva, Ritter. Explicit Substitutions for Linear Logical Frameworks. LFM 1999
5 E. Ritter. Characterising Explicit Substitutions which Preserve Termination. TLCA 1999
6 Ghani, de Paiva, Ritter. Explicit Substitutions for Constructive Necessity. ICALP 1998
7 Ghani, de Paiva, Ritter. Categorical Models for Explicit Substitutions. FoSSaCS 1999.
8 de Paiva, E. Ritter. On Explicit Substitutions and Names. ICALP 1997.
9 Nesi, de Paiva, Ritter. Rewriting Properties of Combinators for Intuitionistic Linear Logic. Higher Order
Algebra, Logic and Term Rewriting, HOA’1993.
10 Maietti, de Paiva and Ritter. Normalization Bounds in Rudimentary Linear Logic ICC, 2002.
11 de Paiva and Eike Ritter. Variations on Linear PCF. WESTAPP, 1999.
8 / 31
11. 10/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Categorical Models for what?
Explicit substitutions
In computer science, lambda calculi are said to have expli-
cit substitutions if they pay special attention to the forma-
lization of the process of substitution. This is in contrast
to the standard lambda calculus where substitutions are
performed by beta reductions in an implicit manner which
is not expressed within the calculus.
The concept of explicit substitutions has become notorious
(despite a large number of published calculi of explicit
substitutions in the literature with quite different characteristics)
because the notion often turns up (implicitly and explicitly) in
formal descriptions [...] Wikipedia, Feb 2021
Syntactic calculi, plenty of them. No models?
10 / 31
12. 11/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Why Categorical Semantics?
Any syntactic calculus worth our attention will have a
categorical semantics
Mathematics as a source of intuition
Showing this for IPL and ILL (works for CS4 too) 11 / 31
13. 12/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Why functional languages?
Programs as mathematical functions transforming inputs into
outputs
Work on inductively defined data structures like lists, trees
⇒ no side effects
⇒ can employ mathematical reasoning and substitute equals for
equals
⇒ function definition and application central part of languages like
ML, Haskell, CAML, OCAML
(usually) Have strong typechecking
⇒ can detect many errors already at compile-time
12 / 31
14. 13/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
What you will NOT see in this talk
Intersection types (idempotent or not)
Evaluation strategies
Dynamic types
Patterns
Proof-nets
Nominal syntax
Geometry of Interaction
explicit substitutions reductions
13 / 31
15. 14/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Prototypical language λ-calculus
Terms:
M ::= x | λx : A.M | MM
Types:
A ::= G | A → A
Meaning of terms:
x: Variable (placeholder)
λx : A.M: Function expecting input of type A
MM: Function application
Single out well-formed terms (check whether correct kind of
argument supplied)
14 / 31
16. 15/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Lambda calculus
Judgements Γ ` M : A
Γ, x : A ` x : A
Γ, x : A ` M : B
Γ ` λx : A.M : A → B
Γ ` M : A → B Γ ` N : A
Γ ` MN : B
To obtain a Turing-complete language, add recursively defined
functions via letrec and add means for defining inductively
defined data structures like lists, trees, etc
Computation done via β-reduction
(λx : A.M)N M[N/x]
where M[N/x] is M with x replaced by N
15 / 31
17. 16/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Environment machines
Implementing β reduction efficiently is hard
Traditional solution:
Reduce λ-terms in an environment
storing bindings of terms for variables separately
⇒ have two kinds of expressions:
Environments hMi /xi i: lists of bindings
Terms: as before plus new closures f ∗ M
Modified β-reduction stores substitution in the environment
(λx.t)u ⇒ hu/xi ∗ t
New rewrite rules to eliminate substitutions
hu/xi ∗ t ⇒∗ t[u/x]
Transforming this ‘trick’ of implementation into a logical calculus
⇒ the reason for ‘explicit substitutions’
16 / 31
18. 17/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
The λσ-Calculus (Abadi, Cardelli, Curien, Lévy 1991)
Terms of the λ-calculus +
Application of a substitution to a term: f ∗ t
Start substitution: hi
Parallel and sequential composition: hf , t/xi, f ; g
Typing Rules:
Substitutions are judgements Γ ` f : ∆
Γ0 ⊆ Γ
Γ ` hi : Γ0
Γ ` f :∆ Γ ` t :A
Γ ` hf , t/xi : ∆, x : A
Γ ` f : ∆ ∆ ` t : A
Γ ` f ∗ t : A
Γ ` f :∆ ∆ ` g :Ψ
Γ ` f ; g : Ψ
Key Idea 1: Every λσ-term is equivalent to a λ-term.
Key Idea 2: Contexts z :A×B and x :A, y :B are not equal
17 / 31
19. 18/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Kesner: Summing-up ES (2009)
explicit substitutions (ES): decomposing implicit substitutions
into atomic steps for a better understanding of the execution
models of higher-order languages;
incorporate substitution operators into the language, and
transform the equalities of the specification into a set of
rewriting rules;
composition of substitutions allows more sophisticated
interactions;
ES can be defined with unary or n-ary substitutions, using de
Bruijn notation or levels or nominal logic, or combinators, or
director strings or named variables;
a calculus with ES can be also seen as a term notation for a
logical system where the reduction rules behave like cut
elimination transformations;
Mellies counter-example 1995 shows ‘a flaw in the design of
ES calculi’
18 / 31
20. 19/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Kesner ES (2009)
ways to avoid Mellies counter-example and recover the SN
property;
weak lambda calculi. not good for proof assistants;
terms with explicit weakening constructors;
Her way: a perpetual reduction strategy and a principle
“Implicit substitution implies normalisation of Explicit
substitution”= IE property;
This extends ideas in [Kes07, Kes08], by the use of
intersection types as well as the use of the Z-property of van
Oostrom [vO] to show confluence.
19 / 31
21. 20/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
What do we want from a Categorical Semantics?
Motivation: What should calculi of explicit substitutions
contain?
What term constructs should we require
What equations should we require
how to discover this for different logics?
Methodology: Extend the Curry Howard correspondence
Category theory as syntax debugging
Internal language gives term constructs equational theory
Key Ideas:
ES model should contain a model of the underlying λ-calculus
Contexts z :A×B and x :A, y :B are isomorphic
20 / 31
23. 22/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Models of Explicit Substitutions — Indexed Categories
Contexts: Modelled by a cartesian category
Objects are contexts, morphisms are substitutions
Cartesian structure is given by parallel composition
Terms: For every context Γ, define the category D(Γ)
Objects are variable-type pairs x : A
Morphisms (x : A) −→ (y : B) are judgements Γ, x : A ` t : B
Re-indexing: Γ ` f :∆ induces a functor D(f ):D(∆) → D(Γ)
Summary: An indexed category is a functor D : Cop → Cat
22 / 31
24. 23/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
What’s Wrong with Indexed Categories?
Plus Points: Indexed categories induce λσ-equations
hi; h = h Identity of C
h; hi = h Identity of C
hi ∗ t = t Functoriality of D
(f ; g); h = f ; (g; h) Assoc of C-comp
(f ; g) ∗ t = f ∗ (g ∗ t) Functoriality of D
Lemma: Soundness and completeness
Problem 1: Indexed Categories are inherently non linear
Identities in the fibres require judgements Γ, x : A ` x : A
Problem 2: No syntax for forming substitutions from terms
23 / 31
25. 24/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Context-Handling Categories
Solution 1: Remove identities by changing codomain to Set
Solution 2: Add two new natural transformations
Defn: Let B be a SMC (CCC) with T ⊆ |B|. A linear
(cartesian) context handling category is a functor
L: Bop → SetsT and for each type, natural isomorphisms
SubA : L(−)A ⇒ B(−, A) TermA : B(−, A) ⇒ L(−)A
Yoneda lemma: There exists VarA ∈ L(A)A with
TermA(f ) = f ∗ VarA
Equations: We get the following equations
h(f ∗ t)/xi = f ; ht/xi Naturality of Sub
ht/xi ∗ x = t One half of the iso
h(f ∗ x)/xi = f Other half of the iso
24 / 31
26. 25/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Adding Type Structure — E-Categories
Context handling categories model the behaviour of explicit
substitutions, eg their formation and application to terms
Types: Since terms are defined on the fibres, modelling type
constructors requires extra structure on the fibres.
Examples: Given types A, B ∈ T , there are types
A → B, A × B ∈ T . In addition there are isomorphisms,
natural in Γ
E((Γ, A))B
E(Γ)A→B
E(Γ)A × E(Γ)B
E(ΓA×B)
Naturality: Equations distribute explicit subs over terms
f ∗ λx.t = λx.f ∗ t f ∗ (tu) = (f ∗ t)(f ∗ u)
Model Collapse: Contexts z :A×B and x :A, y :B are
isomorphic 25 / 31
27. 26/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Adding Linear Type Structure — L-Categories
Functions: Given types A, B ∈ T , there is a type
A −◦ B ∈ T and isomorphisms, natural in Γ
E((Γ, A))B
E(Γ)A −◦ B
Tensor: But the following doesn’t give an iso
z :A⊗B ∼
= x :A, y :B
E((Γ, A, B))C
E(Γ, A ⊗ B)C
Solution: Demand x :A, y :B ` h(x ⊗y)/zi :A⊗B has inverse.
Γ, x : A, y : B ` f : ∆
Γ, z : A ⊗ B ` let z be x ⊗ y in f : ∆
Key Idea: Category theory guiding the design of the calculus
26 / 31
28. 27/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Modelling the !-type Constructor
Key Idea: !-arises as the comonad of a monoidal adjunction
between CCCs and SMCCs
Recall: Models of explicit substitutions
E categories model calculi with →, ×, 1 types
L categories model calculi with −◦ , ⊗, I types
Defn: A !L-category is a monoidal adjunction where C is an
E category, B is an L-category and F, G preserve types.
Crucially: Requires an isomorphism x : A| ∼
= |z :!A
Γ, x : A|∆ ` f : ∆
Γ|∆, z :!A ` let z be !x in f : ∆
27 / 31
29. 28/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Categorical Theorems
Have three theorems for E-categories (CCCs), three for
L-categories (SMCCs), two for putting the E- and L-categories
together into a !L-category.
(right defn) Every E-category contains an underlying CCC and
every CCC extends to an E-category, in an iso way;
(soundness) We can model the λσ calculus in an E-category;
(completeness) If for every E-category, the interpretation of
two morphisms f , f 0 is the same, then the equality of the
morphisms is proved by the λσ theory.
Similarly for L-categories.
For !L-categories, we use Barber’s DILL calculus with explicit
substitutions xDILL, described in Linear Explicit Substitutions
28 / 31
30. 29/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Conclusions
Indexed categories are inherently non-linear so we use
presheaves
Explicit substitutions are tricky to model as extensionally they
are equivalent to their underlying λ-calculus
Our models reflect this by “taking the isomorphisms seriously”
We get a Curry-Howard correspondence justifying our calculus
Have a working indexed-cat model for linear, cartesian, both
as well as the original for the Calculus of Constructions.
can we do System F and modal logics too? shall we do it?
29 / 31
31. 30/31
Motivation
Abstract Machines
Explicit Substitutions
Categorical Semantics
Conclusions
Further Conclusions
Explicit substitutions discussions bogged on a series of issues:
equations-in-context vs raw reductions
de Bruijn indices vs variable names
untyped vs typed calculi
calculus for abstract machines or for proof assistants, etc..
our explicit substitution calculus has been driven by the
correspondence with the (well-established) cat semantics
Ritter showed that every reduction used in abstract machines
terminates, thus SN is not necessary for their design. also
confluence for terms without metavariables is all you need for
abstract machines ⇒ not worried about SN or metavariables
still: what can we say about ES calculi we skipped? what do
we need to say?
30 / 31