Contracts for higher-order functions

DOI10.1145/581478.581484MaRDI QIDQ2949191zbMATH OpenOpenAlexFDO

Authors Robert Bruce Findler, Matthias Felleisen

Publication date 7 October 2015

Published in Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

behavioral specificationscontractshigher-order functionspredicate typingsolfware reliability

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Typed Contracts for Functional Programming
• Contracts made manifest
• Practical typed lazy contracts
• Contracts as Pairs of Projections
• Contracts made manifest

Cited in

(38)

• Sound and complete concolic testing for higher-order functions
• Reconciling method overloading and dynamically typed scripting languages
• HALO, Haskell to logic through denotational semantics
• Polymorphic contracts
• A Debugger-Cooperative Higher-Order Contract System in Python
• A delta for hybrid type checking
• A Principled Approach to Tracking Information Flow in the Presence of Libraries
• Typed Contracts for Functional Programming
• Contracts as Pairs of Projections
• Foundations of dependent interoperability
• An extended account of contract monitoring strategies as patterns of communication
• Practical run-time checking via unobtrusive property caching
• Call-by-name gradual type theory
• Protocol combinators for modeling, testing, and execution of distributed systems
• Blame and coercion: Together again for the first time
• Gradual type theory
• Practical typed lazy contracts
• Temporal higher-order contracts
• Call-by-name gradual type theory
• The interaction of contracts and laziness
• Gradual type-and-effect systems
• Higher order symbolic execution for contract verification and refutation
• Correctness of compiling polymorphism to dynamic typing
• Contracts made manifest
• Dynamic translucency with abstraction kinds and higher-order coercions
• Session-typed concurrent contracts
• Debugging hygienic macros
• Gradual tensor shape checking
• A temporal logic for higher-order functional programs
• Manifest contracts with intersection types
• Static blame for gradual typing
• Space-efficient gradual typing
• Executable contracts for Elixir
• A simple blame calculus for explicit nulls
• Type-directed operational semantics for gradual typing
• Eager and delayed contract monitoring for call-by-value and call-by-name evaluation
• What is a sorting function?
• A generic complete dynamic logic for reasoning about purity and effects

Describes a project that uses

Uses Software

• DrScheme
• Eiffel

This page was built for publication: Contracts for higher-order functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949191)