Abstract
A classical higher-order logic PFsub of partial functions is defined. The logic extends a version of Farmer’s logic PF by enriching the type system of the logic with subset types and dependent types. Validity in PFsub is then reduced to validity in PF by a translation.
Cite
CITATION STYLE
APA
Stump, A. (2003). Subset types and partial functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 151–165). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free