Parametricity for Nested Types and GADTs
This paper considers parametricity and its consequent free theorems for nested data types. Rather than representing nested types via their Church encodings in a higher-kinded or dependently typed extension of System F, we adopt a functional programming perspective and design a Hindley-Milner-style c...
Main Authors: | Patricia Johann, Enrico Ghiorzi |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2021-12-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/7086/pdf |
Similar Items
-
On Nested Sequents for Constructive Modal Logics
by: Lutz Strassburger, et al.
Published: (2015-09-01) -
Inducing syntactic cut-elimination for indexed nested sequents
by: Revantha Ramanayake
Published: (2018-11-01) -
Language Preservation Problems in Parametric Timed Automata
by: Étienne André, et al.
Published: (2020-01-01) -
A case study on parametric verification of failure detectors
by: Thanh-Hai Tran, et al.
Published: (2023-03-01) -
Indexed Induction and Coinduction, Fibrationally
by: Neil Ghani, et al.
Published: (2013-08-01)