DeepAI
Log In Sign Up

Polymorphic System I

01/08/2021
by   Cristian F. Sottile, et al.
0

System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the corresponding isomorphisms. We provide non-standard proofs of subject reduction and strong normalisation, extending those of System I.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/19/2020

Functional Pearl: The Distributive λ-Calculus

We introduce a simple extension of the λ-calculus with pairs—called the ...
09/21/2021

Adding Negation to Lambda Mu

We present L, an extension of Parigot's λμ-calculus by adding negation a...
03/21/2018

An extended type system with lambda-typed lambda-expressions

We present the system d, an extended type system with lambda-typed lambd...
04/08/2022

About Opposition and Duality in Paraconsistent Type Theory

A paraconsistent type theory (an extension of a fragment of intuitionist...
03/17/2018

An extended type system with lambda-typed lambda-expressions (extended version)

We present the type system d, an extended type system with lambda-typed ...
05/08/2020

π with leftovers: a mechanisation in Agda

The π-calculus is a computational model for communication and concurrenc...
04/23/2019

Natural Deduction and Normalization Proofs for the Intersection Type Discipline

Refining and extending previous work by Retoré, we develop a systematic ...