24 search results - page 1 / 5 » Proofs About Lists Using Ellipsis |
LPAR
1999
Springer
14 years 3 months ago
1999
Springer
In this paper we explore the use of ellipsis in proofs about lists. We present a higher-order formulation of elliptic formulae, and describe its implementation in the λClam proof ...
FLOPS
2008
Springer
14 years 8 days ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
APLAS
2011
ACM
12 years 10 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
ENTCS
2008
13 years 10 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...