Partial recursive functions in higher-order logic

Partial recursive functions in higher-order logic (2006)

by Alexander Krauss

Venue:	Int. Joint Conference on Automated Reasoning (IJCAR 2006), LNCS
Citations:	11 - 2 self

Datum	Value	Source
TITLE	Partial recursive functions in higher-order logic	INFERENCE
AUTHOR NAME	Alexander Krauss	SVM HeaderParse 0.2
AUTHOR AFFIL	Technische Universität München, Institut für Informatik	SVM HeaderParse 0.2
ABSTRACT	Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for them. Our method expresses termination in a uniform manner and includes a very general form of pattern matching, where patterns can be arbitrary expressions. Termination proofs can be deferred, restricted to subsets of arguments and are interchangeable with other proofs about the function. We show that this approach can also facilitate termination arguments for total functions, in particular for nested recursions. We implemented our tool as a definitional specification mechanism for Isabelle/HOL. 1	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	Int. Joint Conference on Automated Reasoning (IJCAR 2006), LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	589--603	INFERENCE
CITATIONS	21 found	ParsCit 1.0