Automatically Generating Counterexamples to Naive Free Theorems

DOI10.1007/978-3-642-12251-4_14zbMath1284.68200OpenAlexW1603227274MaRDI QIDQ3558338

Daniel Seidel, Janis Voigtländer

Publication date: 4 May 2010

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12251-4_14

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Safe typing of functional logic programs with opaque patterns and local bindings ⋮ A liberal type system for functional logic programs ⋮ Refined typing to localize the impact of forced strictness on free theorems

Uses Software

• QuickCheck

This page was built for publication: Automatically Generating Counterexamples to Naive Free Theorems