Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
Nina Amla, E. Allen Emerson, Kedar S. Namjoshi, Ri...
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...