Abstract
λ PASym is a natural deduction system for Peano Arithmetic that was developed in order to provide a basis for the programming with-proofs paradigm in a classical logic setting. In the paper we analyze one of its main features: non-confluence. After looking at which rules can cause non-confluence, we develop in the system a formal proof for a formula that can be seen as a simple but meaningful program specification. The computational behaviour of the corresponding term will be analysed by interpreting it as a (higher-order communicating) process formed by distinct subprocesses which co-operate in different ways, producing different results, according to the reduction strategy used. We also show how to restrict the system in order to get confluence without loosing its computational features. The restricted system enables us to argue for the expressive power of symmetric and non-deterministic calculi like λ PASym .
Preview
Unable to display preview. Download preview PDF.
References
Barbanera, F. and Berardi, S. (1996) A symmetric lambda calculus for “classical” program extraction, Information and Computation, Symposium issue on TACS'94, 125(2):103–117.
Danos, V., Joinet, J.-B. and Schellinx, H. A new deconstructive logic: linear logic, to appear in Journal of Symbolic Logic.
Girard J.Y. (1991) A new constructive logic: classical logic. Mathematical Structures in Computer Science, 1(3):255–296.
Kreisel, G. (1951) On the interpretation of non-finitist proofs, Journal of Symbolic Logic, 16(4):241–267.
Kreisel, G. (1958) Mathematical significance of consistency proofs, Journal of Symbolic Logic, 23:155–182.
Nielson (1989) The typed λ-calculus with first-class processes, LNCS 366, Springer-Verlag, 357–369.
Parigot, M. (1991) Free Deduction: an analysis of computation in classical logic. In Voronkov, A., ed., Russian Conference on Logic Programming, 361–380. Springer Verlag. LNAI 592.
Parigot, M. (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. In Voronkov, A., ed., Logic Programming and Automated Reasoning, 190–201. Springer Verlag. LNAI 624.
Takahashi, M. (1995) Parallel reductions in λ-calculus, Information and Computation, 118(1):120–127.
Thomsen, B. (1989) A Calculus of Higher-Order Communicating Systems, ACM, 143.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbanera, F., Berardi, S., Schivalocchi, M. (1997). “Classical” programming-with-proofs in λ PASym : An analysis of non-confluence. In: Abadi, M., Ito, T. (eds) Theoretical Aspects of Computer Software. TACS 1997. Lecture Notes in Computer Science, vol 1281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014559
Download citation
DOI: https://doi.org/10.1007/BFb0014559
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63388-4
Online ISBN: 978-3-540-69530-1
eBook Packages: Springer Book Archive