Pointfree expression and calculation: From quantification to temporal logic

DOI10.1007/s10703-010-0100-2zbMath1211.68080OpenAlexW1970408998MaRDI QIDQ633283

Raymond Boute

Publication date: 31 March 2011

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-010-0100-2

zbMATH Keywords

predicate calculustemporal logicquantifierstransform methodsconcrete category theorygeneric functionalspointfree stylepointwise stylesignal flowTLA

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

A Precise and Reliable Multivariable Chain Rule

Uses Software

• Maple
• APL
• SPIN
• Haskell
• LabVIEW
• Agda
• CalcCheck
• Traffic 4

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Two Notes on Notation
• Exercises in Quantifier Manipulation
• Can programming be liberated from the von Neumann style?
• Theories of Programming Languages
• Temporal algebra
• Categories for Types
• Reading, Writing, and Proving
• Fuzzy sets
• Integrated Formal Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item