25 search results - page 1 / 5 » A Mechanization of Strong Kleene Logic for Partial Functions |
CADE
1994
Springer
15 years 1 months ago
1994
Springer
Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic acc...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
119
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
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 ...