Nominal system T

DOI10.1145/1706299.1706321zbMath1312.68066OpenAlexW2019551218MaRDI QIDQ5255070

Andrew M. Pitts

Publication date: 11 June 2015

Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1706299.1706321

zbMATH Keywords

typesrecursionbindersalpha-equivalence

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Binding in Nominal Equational Logic ⋮ Formalizing adequacy: a case study for higher-order abstract syntax ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Structural recursion with locally scoped names ⋮ Principal Types for Nominal Theories

This page was built for publication: Nominal system T