Erasure and Polymorphism in Pure Type Systems

DOI10.1007/978-3-540-78499-9_25zbMath1138.68361OpenAlexW2140216155MaRDI QIDQ5458371

Nathan Mishra-Linger, T. Sheard

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_25

Mathematics Subject Classification ID

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

Related Items (5)

Foundations of dependent interoperability ⋮ Extracting functional programs from Coq, in Coq ⋮ A dependent dependency calculus ⋮ Unnamed Item ⋮ Is Impredicativity Implicitly Implicit

Uses Software

• Automath

This page was built for publication: Erasure and Polymorphism in Pure Type Systems