Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem

DOI10.1016/j.entcs.2008.12.068zbMath1336.68030OpenAlexW2092486320MaRDI QIDQ4982054

Hugh Gibbons

Publication date: 23 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.068

zbMATH Keywords

functional programmingdefinite descriptionsassertionspartial and total correctness

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Uses Software

• QuickCheck

Cites Work

• Synthesis: Dreams → Programs
• Derivation of Invariant Assertions During Program Development by Transformation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definite Descriptions and Dijkstra's Odd Powers of Odd Integers Problem