68 search results - page 8 / 14 » Mathematical Induction in Otter-Lambda |
AUSAI
1998
Springer
13 years 10 months ago
1998
Springer
Naive Bayesian classi ers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predic...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
ENTCS
2006
13 years 7 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
TLDI
2005
ACM
14 years 16 days ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
CALCO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...