Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types

DOI10.1007/978-3-642-39634-2_20zbMath1317.68231OpenAlexW2170604995MaRDI QIDQ5327349

Mark Bickford, Vincent Rahli, Abhishek Anand

Publication date: 7 August 2013

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39634-2_20

Mathematics Subject Classification ID

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

Related Items (2)

Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Exercising Nuprl’s Open-Endedness

Uses Software

• Nuprl

This page was built for publication: Formal Program Optimization in Nuprl Using Computational Equivalence and Partial Types