Fixed Points, Induction, and Coinduction in Order Theory, Set Theory, (PL) Type Theory, Category Theory, and Logic: A Concise Summary

12/25/2018
by   Moez A. AbdelGawad, et al.
Rice University
0

In this note we present the formulation of the induction and coinduction principles, and notions related to them such as fixed points, using the language and conventions of each of order theory, set theory, the theory of types in (object-oriented/OOP and functional/FP) programming languages, first-order logic, and category theory, for the purpose of examining some of the similarities and dissimilarities between these six mathematical subdisciplines. As a side-benefit that is relevant to programming languages researchers in particular, our comparison demonstrates one of the fundamental differences between nominal typing (predominant in mainstream OOP) and structural typing (predominant in FP).

READ FULL TEXT

page 1

page 2

page 3

page 4

12/25/2018

Induction, Coinduction, and Fixed Points: A Concise Survey (and Tutorial)

In this survey paper we present the formulation of the induction and coi...
12/25/2018

Induction, Coinduction, and Fixed Points: A Concise Comparative Survey

In this survey article (which hitherto is an ongoing work-in-progress) w...
10/07/2022

Strong Normalization for the Calculus of Constructions

The calculus of constructions (CC) is a core theory for dependently type...
08/16/2023

Types, equations, dimensions and the Pi theorem

The languages of mathematical physics and modelling are endowed with a r...
09/02/2022

Category Theory for Programming

In these lecture notes, we give a brief introduction to some elements of...

Please sign up or login with your details

Forgot password? Click here to reset