Partial Recursive Functions in Higher-Order Logic
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 589-603
- https://doi.org/10.1007/11814771_48
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof AssistantLecture Notes in Computer Science, 2006
- Modelling general recursion in type theoryMathematical Structures in Computer Science, 2005
- Proving and Disproving Termination of Higher-Order FunctionsLecture Notes in Computer Science, 2005
- Interactive Theorem Proving and Program DevelopmentPublished by Springer Science and Business Media LLC ,2004
- Inductive Invariants for Nested RecursionLecture Notes in Computer Science, 2003
- Partial Functions in ACL2Journal of Automated Reasoning, 2003
- The size-change principle for program terminationPublished by Association for Computing Machinery (ACM) ,2001
- Inductive Datatypes in HOL — Lessons Learned in Formal-Logic EngineeringLecture Notes in Computer Science, 1999
- Treating Partiality in a Logic of Total FunctionsThe Computer Journal, 1997
- Termination of Nested and Mutually Recursive AlgorithmsJournal of Automated Reasoning, 1997