Computation with Classical Sequents ( Mathematical Structures in Computer Science

@inproceedings{Bakel2008ComputationWC,
  title={Computation with Classical Sequents ( Mathematical Structures in Computer Science},
  author={Steffen van Bakel and Pierre Lescanne},
  year={2008}
}
X is an untyped continuation-style formal language with a typed subset which provides a Curry-Howard isomorphism for a sequent calculus for implicative classical logic. X can also be viewed as a language for describing nets by composition of basic components connected by wires. These features make X an expressive platform on which many different (applicative) programming paradigms can be mapped. In this paper we will present the syntax and reduction rules for X ; in order to demonstrate its… CONTINUE READING