Sciweavers

JUCS
2008
122views more  JUCS 2008»
13 years 4 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
JLP
2008
81views more  JLP 2008»
13 years 4 months ago
Soft Linear Set Theory
A formulation of na
Richard McKinley
ISMVL
2010
IEEE
186views Hardware» more  ISMVL 2010»
13 years 9 months ago
A Classification of Partial Boolean Clones
We study intervals I(A) of partial clones whose total functions constitute a (total) clone A. In the Boolean case, we provide a complete classification of such intervals (accordin...
Dietlinde Lau, Karsten Schölzel
TPHOL
2009
IEEE
13 years 11 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler