A dependent nominal type theory

DOI10.2168/LMCS-8(1:8)2012zbMath1241.68046arXiv1201.5240MaRDI QIDQ2881075

James Cheney

Publication date: 3 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

dependent typesnominal abstract syntax

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70)

Related Items (5)

Nominal lambda calculus: an internal language for FM-Cartesian closed categories ⋮ Nominal essential intersection types ⋮ Unnamed Item ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ A dependent type theory with abstractable names

Uses Software

• Freshml

This page was built for publication: A dependent nominal type theory