Partial functions in a total setting

DOI10.1023/A:1005702928286MaRDI QIDQ679251zbMATH OpenFDO

Authors Simon Finn, John Longley, Michael Paul Fourman

Publication date 7 September 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

partial recursive functionsmechanical theorem proving

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Partial logics reconsidered: A conservative approach
• Partial functions in type theory
• Partial functions in ACL2
• scientific article; zbMATH DE number 4210120

Cited in

(17)

• Partial functions in type theory
• Partiality and recursion in higher-order logic
• Fast and loose reasoning is morally correct
• A step-indexing approach to partial functions
• Partial logics reconsidered: A conservative approach
• Extending a first order predicate calculus with partially defined iota terms
• Partial Recursive Functions in Higher-Order Logic
• A typed logic of partial functions reconstructed classically
• Reasoning about partial functions in the formal development of programs
• Partial functions in ACL2
• Theorem proving for classical logic with partial functions by reduction to Kleene logic
• Partiality and recursion in interactive theorem provers -- an overview
• scientific article; zbMATH DE number 4074542 (Why is no real title available?)
• A two-valued logic for properties of strict functional programs allowing partial functions
• A mechanization of strong Kleene logic for partial functions
• Partial and nested recursive function definitions in higher-order logic
• A practical approach to partial functions in CVC Lite

This page was built for publication: Partial functions in a total setting

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