On behavioural abstraction and behavioural satisfaction in higher-order logic
DOI10.1007/3-540-59293-8_199zbMATH Open1496.68190OpenAlexW1694382542MaRDI QIDQ5096735FDOQ5096735
Authors: Martin Hofmann, Donald Sannella 
Publication date: 18 August 2022
Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59293-8_199
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- On observational equivalence and algebraic specification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two impossibility theorems on behaviour specification of abstract data types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On behavioural abstraction and behavioural satisfaction in higher-order logic
- Title not available (Why is that?)
Cited In (5)
- Behavioural and abstractor specifications revisited
- Behavioural equivalence and indistinguishability in higher-order typed languages.
- Title not available (Why is that?)
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs
- Behavioural satisfaction and equivalence in concrete model categories
This page was built for publication: On behavioural abstraction and behavioural satisfaction in higher-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096735)
