Fast and loose reasoning is morally correct

DOI10.1145/1111037.1111056zbMath1370.68042OpenAlexW2021982406MaRDI QIDQ5348924

No author found.

Publication date: 21 August 2017

Published in: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

equational reasoninginductive typespartial valuescoinductive typespartial languagesinfinite valueslifted typesnon-strict languagesstrict languagestotal languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

LF+ in Coq for "fast and loose" reasoning ⋮ Implementing Cantor’s Paradise ⋮ Trends in trends in functional programming 1999/2000 versus 2007/2008 ⋮ Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ A representation theorem for second-order functionals ⋮ Interleaving data and effects ⋮ Notions of computation as monoids ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Parametricity, type equality, and higher-order polymorphism ⋮ Modularity and Implementation of Mathematical Operational Semantics ⋮ Proving Properties of Lazy Functional Programs with Sparkle ⋮ Extensional equality preservation and verified generic programming

This page was built for publication: Fast and loose reasoning is morally correct