Roles, stacks, histories: A triple for Hoare
From MaRDI portal
Publication:3021420
DOI10.1017/S0956796810000134zbMath1220.68044OpenAlexW3047140595MaRDI QIDQ3021420
Johannes Borgström, Riccardo Pucella, Andrew D. Gordon
Publication date: 25 July 2011
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0956796810000134
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- A Hoare Logic for Call-by-Value Functional Programs
- Simplify: a theorem prover for program checking
- Parameterised notions of computation
- Typestate: A programming language concept for enhancing software reliability
- Comprehending monads
- Stack-based access control and secure information flow
- Subtyping dependent types
This page was built for publication: Roles, stacks, histories: A triple for Hoare