Static contract checking for Haskell
DOI10.1145/1480881.1480889zbMATH Open1315.68107OpenAlexW2059703978MaRDI QIDQ5261504FDOQ5261504
Authors: Dana N. Xu, Koen Claessen, Simon Peyton-Jones 
Publication date: 3 July 2015
Published in: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1480881.1480889
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)
Cited In (16)
- Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
- Parametricity for Haskell with Imprecise Error Semantics
- An extended account of contract monitoring strategies as patterns of communication
- Refinement types for Haskell
- Testing and tracing lazy functional programs using QuickCheck and Hat
- Gradual type theory
- Static contract checking with abstract interpretation
- Practical typed lazy contracts
- Combining static and dynamic contract checking for Curry
- Combining static and dynamic contract checking for Curry
- Second-order programs with preconditions
- Space-efficient gradual typing
- Higher order symbolic execution for contract verification and refutation
- Transformations for compositional verification of assumption-commitment properties
- HALO, Haskell to logic through denotational semantics
- The interaction of contracts and laziness
Uses Software
This page was built for publication: Static contract checking for Haskell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261504)
