331 search results - page 11 / 67 » HOLCF: Higher Order Logic of Computable Functions |
108
click to vote
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
IJCV
2010
14 years 8 months ago
2010
This paper addresses the segmentation from an image of entities that have the form of a ‘network’, i.e. the region in the image corresponding to the entity is composed of bran...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
TPHOL
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper describes the concept of higher order quotients and an implementation in Isabelle. Higher order quotients are a generalization of quotients. They use partial equivalence...
75
Voted
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...