Polymorphic Contracts

DOI10.1007/978-3-642-19718-5_2zbMath1326.68077OpenAlexW4205626690MaRDI QIDQ3000571

Atsushi Igarashi, Benjamin C. Pierce, Michael Greenberg, João Filipe Belo

Publication date: 19 May 2011

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19718-5_2

zbMATH Keywords

contractssubtypinglogical relationsparametric polymorphismrefinement typesabstract datatypessyntactic proofdynamic checkingpostconditionspreconditions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A syntactic approach to type soundness
• Contracts for higher-order functions
• Well-Typed Programs Can’t Be Blamed
• Practical Variable-Arity Polymorphism
• Contracts made manifest
• Hybrid type checking
• Blame for all
• Parametric Polymorphism through Run-Time Sealing or, Theorems for Low, Low Prices!
• Type Reconstruction for General Refinement Types
• Subtyping dependent types

This page was built for publication: Polymorphic Contracts