Types for Proofs and Programs

DOI10.1007/11617990zbMath1172.68547OpenAlexW4300050167MaRDI QIDQ5898169

Robin Adams

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11617990

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Tower Induction and Up-to Techniques for CCS with Fixed Points ⋮ Some Domain Theory and Denotational Semantics in Coq ⋮ Unnamed Item ⋮ Strongly typed term representations in Coq ⋮ POPLMark reloaded: Mechanizing proofs by logical relations

Uses Software

• Automath
• Unnamed Item

This page was built for publication: Types for Proofs and Programs