scientific article; zbMATH DE number 7393565

zbMath1471.03023arXiv1309.1256MaRDI QIDQ4957789

No author found.

Publication date: 9 September 2021

Full work available at URL: https://arxiv.org/abs/1309.1256

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40) Type theory (03B38)

Related Items (1)

Graded modal dependent type theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finitely stratified polymorphism
• An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
• Syntactic Metatheory of Higher-Order Subtyping
• Implementing a normalizer using sized heterogeneous types
• Proofs of strong normalisation for second order classical natural deduction
• Types for Proofs and Programs
• Types for Proofs and Programs
• Weak normalization implies strong normalization in a class of non-dependent pure type systems

This page was built for publication: