The connection between two ways of reasoning about partial functions

DOI10.1016/J.IPL.2008.02.005zbMath1186.68288OpenAlexW2109325556WikidataQ59597936 ScholiaQ59597936MaRDI QIDQ963419

John S. Fitzgerald, Cliff B. Jones

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.005

zbMATH Keywords

specification languagespartial functionsformal methodslogicequalityLPF

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

A two-valued logic for properties of strict functional programs allowing partial functions

Uses Software

• mural

Cites Work

• A logic covering undefinedness in program proofs
• A typed logic of partial functions reconstructed classically
• A set theory with support for partial functions
• The B-Book
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The connection between two ways of reasoning about partial functions