Sciweavers

25 search results - page 1 / 5
» A Mechanization of Strong Kleene Logic for Partial Functions
Sort
View
CADE
1994
Springer
15 years 2 months ago
A Mechanization of Strong Kleene Logic for Partial Functions
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...
Manfred Kerber, Michael Kohlhase
CCA
2009
Springer
15 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
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 ...
Vasco Brattka, Guido Gherardi
121
Voted
CORR
2004
Springer
128views Education» more  CORR 2004»
14 years 10 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
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...
María Alpuente, Michael Hanus, Salvador Luc...
LPAR
2010
Springer
14 years 8 months ago
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
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...
Benjamin Grégoire, Jorge Luis Sacchini
CADE
2006
Springer
15 years 10 months ago
Partial Recursive Functions in Higher-Order Logic
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 ...
Alexander Krauss