Sciweavers

261 search results - page 17 / 53
» Proof Normalization Modulo
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 6 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
ENTCS
2006
131views more  ENTCS 2006»
13 years 6 months ago
Development Separation in Lambda-Calculus
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
Hongwei Xi
IGPL
2007
107views more  IGPL 2007»
13 years 6 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
IFIP
2004
Springer
14 years 3 days ago
The Simply-typed Pure Pattern Type System Ensures Strong Normalization
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
Benjamin Wack
TLCA
2007
Springer
14 years 25 days ago
Strong Normalization and Equi-(Co)Inductive Types
e type system for the l—m˜d—E™—l™ulus enri™hed with re™urE sive —nd ™ore™ursive fun™tions over equiEindu™tive —nd E™oindu™tive types is presented in whi™h —ll wel...
Andreas Abel