Sciweavers

24 search results - page 1 / 5
» Proofs About Lists Using Ellipsis
Sort
View
LPAR
1999
Springer
14 years 3 months ago
Proofs About Lists Using Ellipsis
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 ...
Alan Bundy, Julian Richardson
FLOPS
2008
Springer
14 years 8 days ago
Proving Properties about Lists Using Containers
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...
Rawle Prince, Neil Ghani, Conor McBride
APLAS
2011
ACM
12 years 10 months ago
Constructing List Homomorphisms from Proofs
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...
Yun-Yan Chi, Shin-Cheng Mu
ENTCS
2008
120views more  ENTCS 2008»
13 years 10 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
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...
Alan P. Sexton, Hayo Thielecke
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 10 months ago
Induction and Co-induction in Sequent Calculus
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...
Alwen Tiu, Alberto Momigliano