Polarised subtyping for sized types (Q3535676)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Polarised subtyping for sized types	scientific article

Statements

scholarly article

0 references

Polarised subtyping for sized types (English)

0 references

0 references

Mathematical Structures in Computer Science

0 references

publication date

13 November 2008

0 references

zbMATH Keywords

subtyping calculus

0 references

MaRDI profile type

MaRDI publication profile

0 references

Generalizing generalized tries

0 references

Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\)

0 references

Typed operational semantics for higher-order subtyping.

0 references

de Bruijn notation as a nested datatype

0 references

Type-based termination of recursive definitions

0 references

Anti-symmetry of higher-order subtyping and equality by subtyping

0 references

Iteration and coiteration schemes for higher-order and nested datatypes

0 references

Perpetual reductions in \(\lambda\)-calculus

0 references

Higher-order subtyping

0 references

On equivalence and canonical forms in the LF type theory

0 references

Identifiers

zbMATH Open document ID

0 references

10.1017/S0960129508006853

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3535676

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3535676&oldid=35080086"